./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i -s /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cfad0b2f92a7cfe2a62ca103d0ef6e2a604561400f9f39e859a6074e6dd658e5
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-02-28 20:52:52,941 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-02-28 20:52:52,976 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-02-28 20:52:52,979 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-02-28 20:52:52,979 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-02-28 20:52:52,998 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-02-28 20:52:52,998 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-02-28 20:52:52,998 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-02-28 20:52:52,999 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-02-28 20:52:52,999 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-02-28 20:52:52,999 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-02-28 20:52:53,000 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-02-28 20:52:53,000 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-02-28 20:52:53,000 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-02-28 20:52:53,001 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-02-28 20:52:53,001 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-02-28 20:52:53,001 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-02-28 20:52:53,001 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-02-28 20:52:53,002 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-02-28 20:52:53,002 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-02-28 20:52:53,002 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-02-28 20:52:53,003 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-02-28 20:52:53,003 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-02-28 20:52:53,003 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-02-28 20:52:53,003 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-02-28 20:52:53,003 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-02-28 20:52:53,004 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-02-28 20:52:53,004 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-02-28 20:52:53,004 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-02-28 20:52:53,004 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-02-28 20:52:53,005 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-02-28 20:52:53,005 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-02-28 20:52:53,005 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-02-28 20:52:53,005 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-02-28 20:52:53,006 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-02-28 20:52:53,006 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-02-28 20:52:53,006 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-02-28 20:52:53,006 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-02-28 20:52:53,006 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-02-28 20:52:53,006 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-02-28 20:52:53,010 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-02-28 20:52:53,010 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cfad0b2f92a7cfe2a62ca103d0ef6e2a604561400f9f39e859a6074e6dd658e5
[2024-02-28 20:52:53,178 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-02-28 20:52:53,201 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-02-28 20:52:53,203 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-02-28 20:52:53,204 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-02-28 20:52:53,204 INFO  L274        PluginConnector]: CDTParser initialized
[2024-02-28 20:52:53,205 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i
[2024-02-28 20:52:54,329 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-02-28 20:52:54,517 INFO  L384              CDTParser]: Found 1 translation units.
[2024-02-28 20:52:54,517 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i
[2024-02-28 20:52:54,529 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/8b69d0ea1/6954f370df5747418873988bfc295e1c/FLAG3a158233e
[2024-02-28 20:52:54,884 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/8b69d0ea1/6954f370df5747418873988bfc295e1c
[2024-02-28 20:52:54,886 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-02-28 20:52:54,887 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-02-28 20:52:54,888 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-02-28 20:52:54,888 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-02-28 20:52:54,892 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-02-28 20:52:54,892 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 08:52:54" (1/1) ...
[2024-02-28 20:52:54,893 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5235a6bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:52:54, skipping insertion in model container
[2024-02-28 20:52:54,893 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 08:52:54" (1/1) ...
[2024-02-28 20:52:54,931 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-02-28 20:52:55,193 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-02-28 20:52:55,199 INFO  L202         MainTranslator]: Completed pre-run
[2024-02-28 20:52:55,229 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-02-28 20:52:55,263 INFO  L206         MainTranslator]: Completed translation
[2024-02-28 20:52:55,263 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:52:55 WrapperNode
[2024-02-28 20:52:55,263 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-02-28 20:52:55,264 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-02-28 20:52:55,265 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-02-28 20:52:55,265 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-02-28 20:52:55,270 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:52:55" (1/1) ...
[2024-02-28 20:52:55,284 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:52:55" (1/1) ...
[2024-02-28 20:52:55,304 INFO  L138                Inliner]: procedures = 263, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76
[2024-02-28 20:52:55,304 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-02-28 20:52:55,304 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-02-28 20:52:55,305 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-02-28 20:52:55,305 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-02-28 20:52:55,312 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:52:55" (1/1) ...
[2024-02-28 20:52:55,312 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:52:55" (1/1) ...
[2024-02-28 20:52:55,315 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:52:55" (1/1) ...
[2024-02-28 20:52:55,315 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:52:55" (1/1) ...
[2024-02-28 20:52:55,321 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:52:55" (1/1) ...
[2024-02-28 20:52:55,324 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:52:55" (1/1) ...
[2024-02-28 20:52:55,325 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:52:55" (1/1) ...
[2024-02-28 20:52:55,326 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:52:55" (1/1) ...
[2024-02-28 20:52:55,328 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-02-28 20:52:55,329 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-02-28 20:52:55,329 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-02-28 20:52:55,329 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-02-28 20:52:55,329 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:52:55" (1/1) ...
[2024-02-28 20:52:55,334 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-02-28 20:52:55,341 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:52:55,358 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-02-28 20:52:55,363 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-02-28 20:52:55,395 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-02-28 20:52:55,395 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-02-28 20:52:55,395 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-02-28 20:52:55,395 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-02-28 20:52:55,395 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-02-28 20:52:55,395 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2024-02-28 20:52:55,395 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-02-28 20:52:55,395 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-02-28 20:52:55,395 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-02-28 20:52:55,395 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-02-28 20:52:55,396 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-02-28 20:52:55,541 INFO  L241             CfgBuilder]: Building ICFG
[2024-02-28 20:52:55,542 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-02-28 20:52:55,704 INFO  L282             CfgBuilder]: Performing block encoding
[2024-02-28 20:52:55,712 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-02-28 20:52:55,712 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-02-28 20:52:55,714 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 08:52:55 BoogieIcfgContainer
[2024-02-28 20:52:55,714 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-02-28 20:52:55,716 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-02-28 20:52:55,716 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-02-28 20:52:55,718 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-02-28 20:52:55,718 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.02 08:52:54" (1/3) ...
[2024-02-28 20:52:55,718 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d4db96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 08:52:55, skipping insertion in model container
[2024-02-28 20:52:55,719 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:52:55" (2/3) ...
[2024-02-28 20:52:55,719 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d4db96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 08:52:55, skipping insertion in model container
[2024-02-28 20:52:55,719 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 08:52:55" (3/3) ...
[2024-02-28 20:52:55,720 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid.i
[2024-02-28 20:52:55,726 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-02-28 20:52:55,734 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-02-28 20:52:55,734 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2024-02-28 20:52:55,734 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-02-28 20:52:55,781 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-02-28 20:52:55,806 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 100 places, 101 transitions, 209 flow
[2024-02-28 20:52:55,846 INFO  L124   PetriNetUnfolderBase]: 6/144 cut-off events.
[2024-02-28 20:52:55,847 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-02-28 20:52:55,851 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 149 conditions, 144 events. 6/144 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 223 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. 
[2024-02-28 20:52:55,851 INFO  L82        GeneralOperation]: Start removeDead. Operand has 100 places, 101 transitions, 209 flow
[2024-02-28 20:52:55,854 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 100 places, 101 transitions, 209 flow
[2024-02-28 20:52:55,861 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 20:52:55,866 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@b21abaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-02-28 20:52:55,866 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-02-28 20:52:55,876 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-28 20:52:55,876 INFO  L124   PetriNetUnfolderBase]: 3/47 cut-off events.
[2024-02-28 20:52:55,876 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-28 20:52:55,876 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:52:55,877 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:52:55,877 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-02-28 20:52:55,881 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:52:55,881 INFO  L85        PathProgramCache]: Analyzing trace with hash 1611920299, now seen corresponding path program 1 times
[2024-02-28 20:52:55,888 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:52:55,889 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755608425]
[2024-02-28 20:52:55,889 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:52:55,889 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:52:55,978 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:52:56,143 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:52:56,144 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:52:56,144 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755608425]
[2024-02-28 20:52:56,144 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755608425] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:52:56,144 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:52:56,145 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:52:56,146 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440286736]
[2024-02-28 20:52:56,146 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:52:56,152 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-02-28 20:52:56,156 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:52:56,175 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-02-28 20:52:56,176 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-02-28 20:52:56,294 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 101
[2024-02-28 20:52:56,296 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 101 transitions, 209 flow. Second operand  has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:56,297 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:52:56,297 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 101
[2024-02-28 20:52:56,297 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:52:56,346 INFO  L124   PetriNetUnfolderBase]: 1/145 cut-off events.
[2024-02-28 20:52:56,346 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-02-28 20:52:56,347 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172 conditions, 145 events. 1/145 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 176 event pairs, 0 based on Foata normal form. 2/138 useless extension candidates. Maximal degree in co-relation 39. Up to 16 conditions per place. 
[2024-02-28 20:52:56,348 INFO  L140   encePairwiseOnDemand]: 90/101 looper letters, 11 selfloop transitions, 2 changer transitions 6/103 dead transitions.
[2024-02-28 20:52:56,348 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 103 transitions, 249 flow
[2024-02-28 20:52:56,349 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:52:56,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:52:56,357 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 534 transitions.
[2024-02-28 20:52:56,360 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8811881188118812
[2024-02-28 20:52:56,360 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 534 transitions.
[2024-02-28 20:52:56,361 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 534 transitions.
[2024-02-28 20:52:56,362 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:52:56,364 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 534 transitions.
[2024-02-28 20:52:56,368 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:56,373 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:56,373 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:56,374 INFO  L175             Difference]: Start difference. First operand has 100 places, 101 transitions, 209 flow. Second operand 6 states and 534 transitions.
[2024-02-28 20:52:56,375 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 103 transitions, 249 flow
[2024-02-28 20:52:56,378 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 103 transitions, 249 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:52:56,380 INFO  L231             Difference]: Finished difference. Result has 109 places, 97 transitions, 219 flow
[2024-02-28 20:52:56,382 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=109, PETRI_TRANSITIONS=97}
[2024-02-28 20:52:56,385 INFO  L281   CegarLoopForPetriNet]: 100 programPoint places, 9 predicate places.
[2024-02-28 20:52:56,385 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 97 transitions, 219 flow
[2024-02-28 20:52:56,385 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:56,385 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:52:56,385 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:52:56,386 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-02-28 20:52:56,386 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-02-28 20:52:56,386 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:52:56,386 INFO  L85        PathProgramCache]: Analyzing trace with hash -1197760859, now seen corresponding path program 1 times
[2024-02-28 20:52:56,387 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:52:56,387 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997086004]
[2024-02-28 20:52:56,387 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:52:56,387 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:52:56,408 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:52:56,681 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:52:56,682 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:52:56,682 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997086004]
[2024-02-28 20:52:56,682 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997086004] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:52:56,682 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:52:56,682 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:52:56,682 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163564857]
[2024-02-28 20:52:56,683 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:52:56,683 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:52:56,684 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:52:56,684 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:52:56,684 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:52:56,880 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 66 out of 101
[2024-02-28 20:52:56,880 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 97 transitions, 219 flow. Second operand  has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:56,880 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:52:56,880 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 101
[2024-02-28 20:52:56,881 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:52:57,027 INFO  L124   PetriNetUnfolderBase]: 90/425 cut-off events.
[2024-02-28 20:52:57,027 INFO  L125   PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES.
[2024-02-28 20:52:57,029 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 701 conditions, 425 events. 90/425 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2037 event pairs, 52 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 588. Up to 200 conditions per place. 
[2024-02-28 20:52:57,030 INFO  L140   encePairwiseOnDemand]: 90/101 looper letters, 31 selfloop transitions, 22 changer transitions 0/118 dead transitions.
[2024-02-28 20:52:57,031 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 118 transitions, 367 flow
[2024-02-28 20:52:57,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:52:57,031 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:52:57,032 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 450 transitions.
[2024-02-28 20:52:57,033 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7425742574257426
[2024-02-28 20:52:57,033 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 450 transitions.
[2024-02-28 20:52:57,033 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 450 transitions.
[2024-02-28 20:52:57,033 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:52:57,033 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 450 transitions.
[2024-02-28 20:52:57,034 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:57,036 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:57,036 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:57,036 INFO  L175             Difference]: Start difference. First operand has 109 places, 97 transitions, 219 flow. Second operand 6 states and 450 transitions.
[2024-02-28 20:52:57,037 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 118 transitions, 367 flow
[2024-02-28 20:52:57,038 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 118 transitions, 353 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-02-28 20:52:57,040 INFO  L231             Difference]: Finished difference. Result has 110 places, 118 transitions, 355 flow
[2024-02-28 20:52:57,041 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=110, PETRI_TRANSITIONS=118}
[2024-02-28 20:52:57,041 INFO  L281   CegarLoopForPetriNet]: 100 programPoint places, 10 predicate places.
[2024-02-28 20:52:57,041 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 118 transitions, 355 flow
[2024-02-28 20:52:57,042 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:57,042 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:52:57,042 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:52:57,042 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-02-28 20:52:57,042 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-02-28 20:52:57,043 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:52:57,043 INFO  L85        PathProgramCache]: Analyzing trace with hash 1553811323, now seen corresponding path program 1 times
[2024-02-28 20:52:57,043 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:52:57,044 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659073569]
[2024-02-28 20:52:57,044 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:52:57,044 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:52:57,065 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:52:57,282 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:52:57,282 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:52:57,282 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659073569]
[2024-02-28 20:52:57,282 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659073569] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:52:57,283 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:52:57,283 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:52:57,283 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2530601]
[2024-02-28 20:52:57,283 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:52:57,283 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:52:57,284 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:52:57,284 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:52:57,284 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:52:57,370 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 71 out of 101
[2024-02-28 20:52:57,371 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 118 transitions, 355 flow. Second operand  has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:57,371 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:52:57,371 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 101
[2024-02-28 20:52:57,372 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:52:57,606 INFO  L124   PetriNetUnfolderBase]: 197/680 cut-off events.
[2024-02-28 20:52:57,606 INFO  L125   PetriNetUnfolderBase]: For 159/189 co-relation queries the response was YES.
[2024-02-28 20:52:57,609 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1456 conditions, 680 events. 197/680 cut-off events. For 159/189 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3717 event pairs, 42 based on Foata normal form. 0/633 useless extension candidates. Maximal degree in co-relation 1338. Up to 341 conditions per place. 
[2024-02-28 20:52:57,611 INFO  L140   encePairwiseOnDemand]: 82/101 looper letters, 41 selfloop transitions, 64 changer transitions 7/177 dead transitions.
[2024-02-28 20:52:57,611 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 177 transitions, 753 flow
[2024-02-28 20:52:57,614 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:52:57,614 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:52:57,616 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions.
[2024-02-28 20:52:57,617 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8366336633663366
[2024-02-28 20:52:57,617 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 507 transitions.
[2024-02-28 20:52:57,617 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 507 transitions.
[2024-02-28 20:52:57,618 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:52:57,618 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 507 transitions.
[2024-02-28 20:52:57,620 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:57,623 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:57,624 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:57,624 INFO  L175             Difference]: Start difference. First operand has 110 places, 118 transitions, 355 flow. Second operand 6 states and 507 transitions.
[2024-02-28 20:52:57,624 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 177 transitions, 753 flow
[2024-02-28 20:52:57,627 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 177 transitions, 753 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:52:57,629 INFO  L231             Difference]: Finished difference. Result has 120 places, 170 transitions, 833 flow
[2024-02-28 20:52:57,629 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=833, PETRI_PLACES=120, PETRI_TRANSITIONS=170}
[2024-02-28 20:52:57,630 INFO  L281   CegarLoopForPetriNet]: 100 programPoint places, 20 predicate places.
[2024-02-28 20:52:57,630 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 170 transitions, 833 flow
[2024-02-28 20:52:57,630 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:57,630 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:52:57,631 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:52:57,631 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-02-28 20:52:57,631 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-02-28 20:52:57,631 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:52:57,631 INFO  L85        PathProgramCache]: Analyzing trace with hash 675929210, now seen corresponding path program 1 times
[2024-02-28 20:52:57,632 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:52:57,632 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019296514]
[2024-02-28 20:52:57,632 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:52:57,632 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:52:57,649 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:52:57,853 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 20:52:57,853 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:52:57,853 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019296514]
[2024-02-28 20:52:57,854 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019296514] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:52:57,854 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:52:57,854 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:52:57,854 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094865931]
[2024-02-28 20:52:57,854 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:52:57,855 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:52:57,855 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:52:57,856 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:52:57,856 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:52:58,042 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 70 out of 101
[2024-02-28 20:52:58,044 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 170 transitions, 833 flow. Second operand  has 6 states, 6 states have (on average 72.16666666666667) internal successors, (433), 6 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:58,044 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:52:58,044 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 101
[2024-02-28 20:52:58,044 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:52:58,169 INFO  L124   PetriNetUnfolderBase]: 208/743 cut-off events.
[2024-02-28 20:52:58,169 INFO  L125   PetriNetUnfolderBase]: For 608/671 co-relation queries the response was YES.
[2024-02-28 20:52:58,170 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2112 conditions, 743 events. 208/743 cut-off events. For 608/671 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4467 event pairs, 15 based on Foata normal form. 0/720 useless extension candidates. Maximal degree in co-relation 1971. Up to 271 conditions per place. 
[2024-02-28 20:52:58,173 INFO  L140   encePairwiseOnDemand]: 85/101 looper letters, 80 selfloop transitions, 36 changer transitions 0/200 dead transitions.
[2024-02-28 20:52:58,173 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 200 transitions, 1236 flow
[2024-02-28 20:52:58,174 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:52:58,174 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:52:58,175 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 472 transitions.
[2024-02-28 20:52:58,175 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7788778877887789
[2024-02-28 20:52:58,176 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 472 transitions.
[2024-02-28 20:52:58,176 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 472 transitions.
[2024-02-28 20:52:58,176 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:52:58,176 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 472 transitions.
[2024-02-28 20:52:58,177 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:58,178 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:58,178 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:58,179 INFO  L175             Difference]: Start difference. First operand has 120 places, 170 transitions, 833 flow. Second operand 6 states and 472 transitions.
[2024-02-28 20:52:58,179 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 200 transitions, 1236 flow
[2024-02-28 20:52:58,185 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 200 transitions, 1218 flow, removed 9 selfloop flow, removed 0 redundant places.
[2024-02-28 20:52:58,188 INFO  L231             Difference]: Finished difference. Result has 122 places, 199 transitions, 1163 flow
[2024-02-28 20:52:58,188 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1163, PETRI_PLACES=122, PETRI_TRANSITIONS=199}
[2024-02-28 20:52:58,188 INFO  L281   CegarLoopForPetriNet]: 100 programPoint places, 22 predicate places.
[2024-02-28 20:52:58,189 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 199 transitions, 1163 flow
[2024-02-28 20:52:58,189 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 72.16666666666667) internal successors, (433), 6 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:58,189 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:52:58,189 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:52:58,189 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-02-28 20:52:58,189 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-02-28 20:52:58,190 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:52:58,190 INFO  L85        PathProgramCache]: Analyzing trace with hash -1383926440, now seen corresponding path program 1 times
[2024-02-28 20:52:58,190 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:52:58,190 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343444500]
[2024-02-28 20:52:58,190 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:52:58,190 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:52:58,229 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 20:52:58,229 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 20:52:58,239 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 20:52:58,258 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 20:52:58,258 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 20:52:58,259 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2024-02-28 20:52:58,260 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2024-02-28 20:52:58,260 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2024-02-28 20:52:58,260 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2024-02-28 20:52:58,261 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2024-02-28 20:52:58,261 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2024-02-28 20:52:58,261 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2024-02-28 20:52:58,261 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-02-28 20:52:58,261 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2024-02-28 20:52:58,263 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-02-28 20:52:58,263 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-02-28 20:52:58,280 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-02-28 20:52:58,282 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 119 places, 119 transitions, 254 flow
[2024-02-28 20:52:58,298 INFO  L124   PetriNetUnfolderBase]: 11/263 cut-off events.
[2024-02-28 20:52:58,299 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-02-28 20:52:58,299 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 275 conditions, 263 events. 11/263 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 509 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. 
[2024-02-28 20:52:58,299 INFO  L82        GeneralOperation]: Start removeDead. Operand has 119 places, 119 transitions, 254 flow
[2024-02-28 20:52:58,300 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 119 places, 119 transitions, 254 flow
[2024-02-28 20:52:58,301 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 20:52:58,302 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@b21abaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-02-28 20:52:58,302 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-02-28 20:52:58,305 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-28 20:52:58,305 INFO  L124   PetriNetUnfolderBase]: 3/47 cut-off events.
[2024-02-28 20:52:58,305 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-28 20:52:58,305 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:52:58,305 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:52:58,305 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:52:58,306 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:52:58,306 INFO  L85        PathProgramCache]: Analyzing trace with hash -506405909, now seen corresponding path program 1 times
[2024-02-28 20:52:58,306 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:52:58,306 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366416098]
[2024-02-28 20:52:58,306 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:52:58,306 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:52:58,314 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:52:58,360 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:52:58,361 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:52:58,361 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366416098]
[2024-02-28 20:52:58,361 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366416098] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:52:58,361 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:52:58,361 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:52:58,361 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56749737]
[2024-02-28 20:52:58,361 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:52:58,362 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-02-28 20:52:58,362 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:52:58,362 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-02-28 20:52:58,362 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-02-28 20:52:58,435 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 101 out of 119
[2024-02-28 20:52:58,436 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 254 flow. Second operand  has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:58,436 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:52:58,436 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 119
[2024-02-28 20:52:58,436 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:52:58,481 INFO  L124   PetriNetUnfolderBase]: 3/261 cut-off events.
[2024-02-28 20:52:58,482 INFO  L125   PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES.
[2024-02-28 20:52:58,482 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 311 conditions, 261 events. 3/261 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 521 event pairs, 0 based on Foata normal form. 2/246 useless extension candidates. Maximal degree in co-relation 168. Up to 32 conditions per place. 
[2024-02-28 20:52:58,482 INFO  L140   encePairwiseOnDemand]: 108/119 looper letters, 14 selfloop transitions, 2 changer transitions 6/122 dead transitions.
[2024-02-28 20:52:58,482 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 122 transitions, 302 flow
[2024-02-28 20:52:58,483 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:52:58,483 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:52:58,484 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 633 transitions.
[2024-02-28 20:52:58,484 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8865546218487395
[2024-02-28 20:52:58,484 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 633 transitions.
[2024-02-28 20:52:58,484 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 633 transitions.
[2024-02-28 20:52:58,485 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:52:58,485 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 633 transitions.
[2024-02-28 20:52:58,486 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:58,487 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:58,487 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:58,487 INFO  L175             Difference]: Start difference. First operand has 119 places, 119 transitions, 254 flow. Second operand 6 states and 633 transitions.
[2024-02-28 20:52:58,487 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 122 transitions, 302 flow
[2024-02-28 20:52:58,488 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 122 transitions, 302 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:52:58,489 INFO  L231             Difference]: Finished difference. Result has 128 places, 116 transitions, 268 flow
[2024-02-28 20:52:58,489 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=128, PETRI_TRANSITIONS=116}
[2024-02-28 20:52:58,490 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 9 predicate places.
[2024-02-28 20:52:58,490 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 116 transitions, 268 flow
[2024-02-28 20:52:58,490 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:58,491 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:52:58,491 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:52:58,491 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-02-28 20:52:58,491 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:52:58,491 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:52:58,491 INFO  L85        PathProgramCache]: Analyzing trace with hash 1853603548, now seen corresponding path program 1 times
[2024-02-28 20:52:58,492 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:52:58,492 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418708427]
[2024-02-28 20:52:58,492 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:52:58,492 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:52:58,510 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:52:58,647 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:52:58,648 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:52:58,648 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418708427]
[2024-02-28 20:52:58,648 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418708427] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:52:58,648 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:52:58,648 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:52:58,648 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368357408]
[2024-02-28 20:52:58,648 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:52:58,649 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:52:58,649 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:52:58,649 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:52:58,649 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:52:58,805 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 78 out of 119
[2024-02-28 20:52:58,806 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 116 transitions, 268 flow. Second operand  has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:58,806 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:52:58,806 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 119
[2024-02-28 20:52:58,806 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:52:59,182 INFO  L124   PetriNetUnfolderBase]: 1143/3263 cut-off events.
[2024-02-28 20:52:59,183 INFO  L125   PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES.
[2024-02-28 20:52:59,186 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5458 conditions, 3263 events. 1143/3263 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 24950 event pairs, 764 based on Foata normal form. 0/2970 useless extension candidates. Maximal degree in co-relation 4312. Up to 1816 conditions per place. 
[2024-02-28 20:52:59,195 INFO  L140   encePairwiseOnDemand]: 104/119 looper letters, 38 selfloop transitions, 38 changer transitions 0/153 dead transitions.
[2024-02-28 20:52:59,195 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 153 transitions, 494 flow
[2024-02-28 20:52:59,196 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:52:59,196 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:52:59,197 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 544 transitions.
[2024-02-28 20:52:59,197 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7619047619047619
[2024-02-28 20:52:59,197 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 544 transitions.
[2024-02-28 20:52:59,197 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 544 transitions.
[2024-02-28 20:52:59,197 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:52:59,198 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 544 transitions.
[2024-02-28 20:52:59,199 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:59,200 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:59,200 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:59,200 INFO  L175             Difference]: Start difference. First operand has 128 places, 116 transitions, 268 flow. Second operand 6 states and 544 transitions.
[2024-02-28 20:52:59,200 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 153 transitions, 494 flow
[2024-02-28 20:52:59,201 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 153 transitions, 482 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-02-28 20:52:59,203 INFO  L231             Difference]: Finished difference. Result has 130 places, 153 transitions, 510 flow
[2024-02-28 20:52:59,203 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=510, PETRI_PLACES=130, PETRI_TRANSITIONS=153}
[2024-02-28 20:52:59,204 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 11 predicate places.
[2024-02-28 20:52:59,204 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 153 transitions, 510 flow
[2024-02-28 20:52:59,204 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:59,204 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:52:59,204 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:52:59,204 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-02-28 20:52:59,205 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:52:59,205 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:52:59,205 INFO  L85        PathProgramCache]: Analyzing trace with hash -788478302, now seen corresponding path program 1 times
[2024-02-28 20:52:59,205 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:52:59,205 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93861907]
[2024-02-28 20:52:59,205 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:52:59,205 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:52:59,219 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:52:59,389 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:52:59,390 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:52:59,390 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93861907]
[2024-02-28 20:52:59,390 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93861907] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:52:59,390 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:52:59,390 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:52:59,390 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113906990]
[2024-02-28 20:52:59,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:52:59,391 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:52:59,391 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:52:59,392 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:52:59,392 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:52:59,499 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 119
[2024-02-28 20:52:59,500 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 153 transitions, 510 flow. Second operand  has 6 states, 6 states have (on average 85.0) internal successors, (510), 6 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:52:59,500 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:52:59,500 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 119
[2024-02-28 20:52:59,500 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:53:00,162 INFO  L124   PetriNetUnfolderBase]: 2605/6208 cut-off events.
[2024-02-28 20:53:00,162 INFO  L125   PetriNetUnfolderBase]: For 1573/1736 co-relation queries the response was YES.
[2024-02-28 20:53:00,170 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14073 conditions, 6208 events. 2605/6208 cut-off events. For 1573/1736 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 48738 event pairs, 747 based on Foata normal form. 0/5792 useless extension candidates. Maximal degree in co-relation 11520. Up to 3531 conditions per place. 
[2024-02-28 20:53:00,191 INFO  L140   encePairwiseOnDemand]: 92/119 looper letters, 71 selfloop transitions, 124 changer transitions 0/280 dead transitions.
[2024-02-28 20:53:00,191 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 280 transitions, 1400 flow
[2024-02-28 20:53:00,192 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:53:00,192 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:53:00,193 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 625 transitions.
[2024-02-28 20:53:00,193 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8753501400560224
[2024-02-28 20:53:00,193 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 625 transitions.
[2024-02-28 20:53:00,193 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 625 transitions.
[2024-02-28 20:53:00,194 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:53:00,194 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 625 transitions.
[2024-02-28 20:53:00,195 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:00,196 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:00,196 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:00,196 INFO  L175             Difference]: Start difference. First operand has 130 places, 153 transitions, 510 flow. Second operand 6 states and 625 transitions.
[2024-02-28 20:53:00,196 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 280 transitions, 1400 flow
[2024-02-28 20:53:00,200 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 280 transitions, 1400 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:53:00,203 INFO  L231             Difference]: Finished difference. Result has 140 places, 272 transitions, 1554 flow
[2024-02-28 20:53:00,203 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1554, PETRI_PLACES=140, PETRI_TRANSITIONS=272}
[2024-02-28 20:53:00,204 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 21 predicate places.
[2024-02-28 20:53:00,204 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 272 transitions, 1554 flow
[2024-02-28 20:53:00,204 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.0) internal successors, (510), 6 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:00,204 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:53:00,204 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:53:00,205 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-02-28 20:53:00,205 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:53:00,205 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:53:00,205 INFO  L85        PathProgramCache]: Analyzing trace with hash -1288481311, now seen corresponding path program 1 times
[2024-02-28 20:53:00,205 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:53:00,205 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572219123]
[2024-02-28 20:53:00,205 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:53:00,206 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:53:00,225 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:53:00,420 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 20:53:00,421 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:53:00,421 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572219123]
[2024-02-28 20:53:00,421 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572219123] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:53:00,421 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:53:00,421 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:53:00,421 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038647936]
[2024-02-28 20:53:00,421 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:53:00,422 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:53:00,422 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:53:00,422 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:53:00,422 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:53:00,614 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 82 out of 119
[2024-02-28 20:53:00,615 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 272 transitions, 1554 flow. Second operand  has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:00,615 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:53:00,615 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 119
[2024-02-28 20:53:00,615 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:53:01,536 INFO  L124   PetriNetUnfolderBase]: 3224/7675 cut-off events.
[2024-02-28 20:53:01,536 INFO  L125   PetriNetUnfolderBase]: For 6717/7180 co-relation queries the response was YES.
[2024-02-28 20:53:01,551 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23266 conditions, 7675 events. 3224/7675 cut-off events. For 6717/7180 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 62365 event pairs, 459 based on Foata normal form. 0/7327 useless extension candidates. Maximal degree in co-relation 19055. Up to 3823 conditions per place. 
[2024-02-28 20:53:01,581 INFO  L140   encePairwiseOnDemand]: 98/119 looper letters, 170 selfloop transitions, 88 changer transitions 0/360 dead transitions.
[2024-02-28 20:53:01,582 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 360 transitions, 2634 flow
[2024-02-28 20:53:01,583 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:53:01,583 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:53:01,584 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 575 transitions.
[2024-02-28 20:53:01,584 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8053221288515406
[2024-02-28 20:53:01,584 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 575 transitions.
[2024-02-28 20:53:01,584 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 575 transitions.
[2024-02-28 20:53:01,584 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:53:01,584 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 575 transitions.
[2024-02-28 20:53:01,586 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:01,587 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:01,587 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:01,587 INFO  L175             Difference]: Start difference. First operand has 140 places, 272 transitions, 1554 flow. Second operand 6 states and 575 transitions.
[2024-02-28 20:53:01,587 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 360 transitions, 2634 flow
[2024-02-28 20:53:01,610 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 360 transitions, 2616 flow, removed 9 selfloop flow, removed 0 redundant places.
[2024-02-28 20:53:01,614 INFO  L231             Difference]: Finished difference. Result has 150 places, 352 transitions, 2504 flow
[2024-02-28 20:53:01,615 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2504, PETRI_PLACES=150, PETRI_TRANSITIONS=352}
[2024-02-28 20:53:01,615 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 31 predicate places.
[2024-02-28 20:53:01,615 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 352 transitions, 2504 flow
[2024-02-28 20:53:01,616 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:01,616 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:53:01,616 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:53:01,616 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-02-28 20:53:01,616 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:53:01,616 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:53:01,616 INFO  L85        PathProgramCache]: Analyzing trace with hash -1881636041, now seen corresponding path program 1 times
[2024-02-28 20:53:01,616 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:53:01,616 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088464743]
[2024-02-28 20:53:01,617 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:53:01,617 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:53:01,634 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:53:01,838 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 20:53:01,838 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:53:01,838 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088464743]
[2024-02-28 20:53:01,839 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088464743] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:53:01,839 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:53:01,839 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:53:01,839 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101879568]
[2024-02-28 20:53:01,839 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:53:01,839 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:53:01,840 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:53:01,840 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:53:01,840 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:53:01,995 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 119
[2024-02-28 20:53:01,996 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 352 transitions, 2504 flow. Second operand  has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:01,996 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:53:01,996 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 119
[2024-02-28 20:53:01,996 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:53:02,981 INFO  L124   PetriNetUnfolderBase]: 3689/8462 cut-off events.
[2024-02-28 20:53:02,982 INFO  L125   PetriNetUnfolderBase]: For 15130/15592 co-relation queries the response was YES.
[2024-02-28 20:53:03,003 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30661 conditions, 8462 events. 3689/8462 cut-off events. For 15130/15592 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 67986 event pairs, 333 based on Foata normal form. 0/8152 useless extension candidates. Maximal degree in co-relation 25539. Up to 4191 conditions per place. 
[2024-02-28 20:53:03,039 INFO  L140   encePairwiseOnDemand]: 104/119 looper letters, 206 selfloop transitions, 124 changer transitions 0/473 dead transitions.
[2024-02-28 20:53:03,039 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 473 transitions, 4302 flow
[2024-02-28 20:53:03,040 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:53:03,040 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:53:03,041 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions.
[2024-02-28 20:53:03,041 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8487394957983193
[2024-02-28 20:53:03,041 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 606 transitions.
[2024-02-28 20:53:03,041 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions.
[2024-02-28 20:53:03,042 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:53:03,042 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions.
[2024-02-28 20:53:03,043 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:03,044 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:03,045 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:03,045 INFO  L175             Difference]: Start difference. First operand has 150 places, 352 transitions, 2504 flow. Second operand 6 states and 606 transitions.
[2024-02-28 20:53:03,045 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 473 transitions, 4302 flow
[2024-02-28 20:53:03,088 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 473 transitions, 4062 flow, removed 120 selfloop flow, removed 0 redundant places.
[2024-02-28 20:53:03,094 INFO  L231             Difference]: Finished difference. Result has 160 places, 471 transitions, 3984 flow
[2024-02-28 20:53:03,095 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=2360, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3984, PETRI_PLACES=160, PETRI_TRANSITIONS=471}
[2024-02-28 20:53:03,095 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 41 predicate places.
[2024-02-28 20:53:03,096 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 471 transitions, 3984 flow
[2024-02-28 20:53:03,096 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 92.0) internal successors, (552), 6 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:03,096 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:53:03,096 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:53:03,096 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-02-28 20:53:03,096 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:53:03,097 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:53:03,097 INFO  L85        PathProgramCache]: Analyzing trace with hash 2035469547, now seen corresponding path program 1 times
[2024-02-28 20:53:03,097 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:53:03,097 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153079793]
[2024-02-28 20:53:03,097 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:53:03,097 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:53:03,113 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:53:03,463 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:53:03,463 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:53:03,463 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153079793]
[2024-02-28 20:53:03,463 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153079793] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:53:03,463 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506559578]
[2024-02-28 20:53:03,463 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:53:03,464 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:53:03,464 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:53:03,465 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:53:03,469 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-02-28 20:53:03,582 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:53:03,584 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 29 conjunts are in the unsatisfiable core
[2024-02-28 20:53:03,588 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:53:03,627 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:53:03,649 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 20:53:03,650 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 20:53:03,699 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2024-02-28 20:53:03,748 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22
[2024-02-28 20:53:03,763 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:53:03,764 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34
[2024-02-28 20:53:03,783 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:53:03,783 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46
[2024-02-28 20:53:03,812 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34
[2024-02-28 20:53:03,824 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:53:03,824 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:53:03,853 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_370 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_370 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-02-28 20:53:03,883 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6))))))) is different from false
[2024-02-28 20:53:03,902 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_370 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_370 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_370) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2024-02-28 20:53:04,010 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:53:04,011 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53
[2024-02-28 20:53:04,022 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:53:04,022 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32
[2024-02-28 20:53:04,033 INFO  L349             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2024-02-28 20:53:04,034 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1
[2024-02-28 20:53:04,039 INFO  L349             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2024-02-28 20:53:04,040 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1
[2024-02-28 20:53:04,046 INFO  L349             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2024-02-28 20:53:04,046 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1
[2024-02-28 20:53:04,114 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:53:04,114 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506559578] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:53:04,114 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:53:04,114 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19
[2024-02-28 20:53:04,115 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111050491]
[2024-02-28 20:53:04,115 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:53:04,115 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2024-02-28 20:53:04,116 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:53:04,116 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2024-02-28 20:53:04,116 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=221, Unknown=8, NotChecked=96, Total=380
[2024-02-28 20:53:04,264 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 119
[2024-02-28 20:53:04,265 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 471 transitions, 3984 flow. Second operand  has 20 states, 20 states have (on average 56.85) internal successors, (1137), 20 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:04,266 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:53:04,266 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 119
[2024-02-28 20:53:04,266 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:53:09,816 INFO  L124   PetriNetUnfolderBase]: 11518/22882 cut-off events.
[2024-02-28 20:53:09,816 INFO  L125   PetriNetUnfolderBase]: For 45964/46019 co-relation queries the response was YES.
[2024-02-28 20:53:09,870 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 85422 conditions, 22882 events. 11518/22882 cut-off events. For 45964/46019 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 193887 event pairs, 657 based on Foata normal form. 225/22018 useless extension candidates. Maximal degree in co-relation 73538. Up to 7166 conditions per place. 
[2024-02-28 20:53:10,040 INFO  L140   encePairwiseOnDemand]: 91/119 looper letters, 946 selfloop transitions, 553 changer transitions 43/1600 dead transitions.
[2024-02-28 20:53:10,040 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 1600 transitions, 15564 flow
[2024-02-28 20:53:10,041 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2024-02-28 20:53:10,041 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2024-02-28 20:53:10,045 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2674 transitions.
[2024-02-28 20:53:10,046 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6073131955484896
[2024-02-28 20:53:10,046 INFO  L72            ComplementDD]: Start complementDD. Operand 37 states and 2674 transitions.
[2024-02-28 20:53:10,046 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 37 states and 2674 transitions.
[2024-02-28 20:53:10,047 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:53:10,047 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2674 transitions.
[2024-02-28 20:53:10,051 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 38 states, 37 states have (on average 72.27027027027027) internal successors, (2674), 37 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:10,056 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:10,057 INFO  L81            ComplementDD]: Finished complementDD. Result  has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:10,057 INFO  L175             Difference]: Start difference. First operand has 160 places, 471 transitions, 3984 flow. Second operand 37 states and 2674 transitions.
[2024-02-28 20:53:10,057 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 1600 transitions, 15564 flow
[2024-02-28 20:53:10,239 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 1600 transitions, 15264 flow, removed 150 selfloop flow, removed 0 redundant places.
[2024-02-28 20:53:10,251 INFO  L231             Difference]: Finished difference. Result has 219 places, 918 transitions, 10189 flow
[2024-02-28 20:53:10,252 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=3822, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=10189, PETRI_PLACES=219, PETRI_TRANSITIONS=918}
[2024-02-28 20:53:10,252 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 100 predicate places.
[2024-02-28 20:53:10,252 INFO  L495      AbstractCegarLoop]: Abstraction has has 219 places, 918 transitions, 10189 flow
[2024-02-28 20:53:10,253 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 20 states have (on average 56.85) internal successors, (1137), 20 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:10,253 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:53:10,253 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:53:10,265 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-02-28 20:53:10,454 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:53:10,455 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:53:10,455 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:53:10,455 INFO  L85        PathProgramCache]: Analyzing trace with hash -137512625, now seen corresponding path program 1 times
[2024-02-28 20:53:10,456 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:53:10,456 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139501005]
[2024-02-28 20:53:10,456 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:53:10,456 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:53:10,485 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:53:10,791 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:53:10,792 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:53:10,792 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139501005]
[2024-02-28 20:53:10,792 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139501005] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:53:10,792 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508527276]
[2024-02-28 20:53:10,792 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:53:10,792 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:53:10,792 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:53:10,793 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:53:10,795 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-02-28 20:53:10,906 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:53:10,908 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 43 conjunts are in the unsatisfiable core
[2024-02-28 20:53:10,911 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:53:10,984 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:53:11,081 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 20:53:11,082 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 20:53:11,288 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 20:53:11,330 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-02-28 20:53:11,374 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-02-28 20:53:11,427 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-02-28 20:53:11,503 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:53:11,548 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:53:11,548 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:53:11,570 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)))) is different from false
[2024-02-28 20:53:11,595 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_458 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)))))) is different from false
[2024-02-28 20:53:11,628 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_458 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_458) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2024-02-28 20:53:11,840 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:53:11,840 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508527276] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:53:11,840 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:53:11,840 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 15] total 37
[2024-02-28 20:53:11,841 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48846160]
[2024-02-28 20:53:11,841 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:53:11,841 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 38 states
[2024-02-28 20:53:11,842 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:53:11,842 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2024-02-28 20:53:11,843 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1057, Unknown=3, NotChecked=204, Total=1406
[2024-02-28 20:53:11,978 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 38 out of 119
[2024-02-28 20:53:11,979 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 918 transitions, 10189 flow. Second operand  has 38 states, 38 states have (on average 40.31578947368421) internal successors, (1532), 38 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:11,979 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:53:11,980 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 119
[2024-02-28 20:53:11,980 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:53:24,161 INFO  L124   PetriNetUnfolderBase]: 21737/42230 cut-off events.
[2024-02-28 20:53:24,161 INFO  L125   PetriNetUnfolderBase]: For 310964/311115 co-relation queries the response was YES.
[2024-02-28 20:53:24,425 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 220770 conditions, 42230 events. 21737/42230 cut-off events. For 310964/311115 co-relation queries the response was YES. Maximal size of possible extension queue 1248. Compared 385612 event pairs, 2336 based on Foata normal form. 267/40335 useless extension candidates. Maximal degree in co-relation 211110. Up to 14507 conditions per place. 
[2024-02-28 20:53:24,595 INFO  L140   encePairwiseOnDemand]: 79/119 looper letters, 1732 selfloop transitions, 982 changer transitions 32/2796 dead transitions.
[2024-02-28 20:53:24,595 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 2796 transitions, 37755 flow
[2024-02-28 20:53:24,596 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. 
[2024-02-28 20:53:24,596 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 50 states.
[2024-02-28 20:53:24,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 2606 transitions.
[2024-02-28 20:53:24,601 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43798319327731094
[2024-02-28 20:53:24,602 INFO  L72            ComplementDD]: Start complementDD. Operand 50 states and 2606 transitions.
[2024-02-28 20:53:24,602 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 50 states and 2606 transitions.
[2024-02-28 20:53:24,602 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:53:24,603 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 2606 transitions.
[2024-02-28 20:53:24,606 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 51 states, 50 states have (on average 52.12) internal successors, (2606), 50 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:24,612 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 51 states, 51 states have (on average 119.0) internal successors, (6069), 51 states have internal predecessors, (6069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:24,613 INFO  L81            ComplementDD]: Finished complementDD. Result  has 51 states, 51 states have (on average 119.0) internal successors, (6069), 51 states have internal predecessors, (6069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:24,613 INFO  L175             Difference]: Start difference. First operand has 219 places, 918 transitions, 10189 flow. Second operand 50 states and 2606 transitions.
[2024-02-28 20:53:24,613 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 2796 transitions, 37755 flow
[2024-02-28 20:53:27,609 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 2796 transitions, 36383 flow, removed 681 selfloop flow, removed 3 redundant places.
[2024-02-28 20:53:27,635 INFO  L231             Difference]: Finished difference. Result has 283 places, 1804 transitions, 25440 flow
[2024-02-28 20:53:27,636 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=9657, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=918, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=259, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=25440, PETRI_PLACES=283, PETRI_TRANSITIONS=1804}
[2024-02-28 20:53:27,636 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 164 predicate places.
[2024-02-28 20:53:27,636 INFO  L495      AbstractCegarLoop]: Abstraction has has 283 places, 1804 transitions, 25440 flow
[2024-02-28 20:53:27,637 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 38 states, 38 states have (on average 40.31578947368421) internal successors, (1532), 38 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:27,637 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:53:27,637 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:53:27,642 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-02-28 20:53:27,842 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2024-02-28 20:53:27,843 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:53:27,843 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:53:27,844 INFO  L85        PathProgramCache]: Analyzing trace with hash -1487947525, now seen corresponding path program 2 times
[2024-02-28 20:53:27,844 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:53:27,844 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070703121]
[2024-02-28 20:53:27,844 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:53:27,844 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:53:27,866 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:53:28,191 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:53:28,191 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:53:28,192 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070703121]
[2024-02-28 20:53:28,192 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070703121] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:53:28,192 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661720857]
[2024-02-28 20:53:28,192 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-02-28 20:53:28,192 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:53:28,192 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:53:28,193 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:53:28,194 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-02-28 20:53:28,343 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 20:53:28,343 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:53:28,344 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-02-28 20:53:28,410 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:53:28,419 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:53:28,481 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 20:53:28,481 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 20:53:28,690 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 20:53:28,726 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-02-28 20:53:28,770 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-02-28 20:53:28,831 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-02-28 20:53:28,962 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:53:28,997 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:53:28,997 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:53:29,017 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)))) is different from false
[2024-02-28 20:53:29,196 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)))))) is different from false
[2024-02-28 20:53:29,219 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2024-02-28 20:53:29,245 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_546 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_546) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false
[2024-02-28 20:53:29,264 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:53:29,264 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66
[2024-02-28 20:53:29,269 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:53:29,269 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 38
[2024-02-28 20:53:29,272 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3
[2024-02-28 20:53:29,283 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 20:53:29,298 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-02-28 20:53:29,305 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 20:53:29,305 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-02-28 20:53:29,316 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 20:53:29,316 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-02-28 20:53:29,361 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:53:29,362 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [661720857] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:53:29,362 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:53:29,362 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 31
[2024-02-28 20:53:29,362 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645598331]
[2024-02-28 20:53:29,362 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:53:29,362 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-02-28 20:53:29,363 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:53:29,363 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-02-28 20:53:29,364 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=641, Unknown=12, NotChecked=220, Total=992
[2024-02-28 20:53:29,529 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 51 out of 119
[2024-02-28 20:53:29,530 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 1804 transitions, 25440 flow. Second operand  has 32 states, 32 states have (on average 52.96875) internal successors, (1695), 32 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:29,530 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:53:29,530 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 119
[2024-02-28 20:53:29,530 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:53:54,624 INFO  L124   PetriNetUnfolderBase]: 33983/67830 cut-off events.
[2024-02-28 20:53:54,624 INFO  L125   PetriNetUnfolderBase]: For 819169/819526 co-relation queries the response was YES.
[2024-02-28 20:53:55,204 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 394900 conditions, 67830 events. 33983/67830 cut-off events. For 819169/819526 co-relation queries the response was YES. Maximal size of possible extension queue 1917. Compared 680772 event pairs, 3913 based on Foata normal form. 158/65013 useless extension candidates. Maximal degree in co-relation 388489. Up to 24226 conditions per place. 
[2024-02-28 20:53:55,509 INFO  L140   encePairwiseOnDemand]: 83/119 looper letters, 2302 selfloop transitions, 1329 changer transitions 38/3734 dead transitions.
[2024-02-28 20:53:55,510 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 3734 transitions, 59987 flow
[2024-02-28 20:53:55,510 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2024-02-28 20:53:55,511 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2024-02-28 20:53:55,513 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2550 transitions.
[2024-02-28 20:53:55,513 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5791505791505791
[2024-02-28 20:53:55,513 INFO  L72            ComplementDD]: Start complementDD. Operand 37 states and 2550 transitions.
[2024-02-28 20:53:55,514 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 37 states and 2550 transitions.
[2024-02-28 20:53:55,514 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:53:55,514 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2550 transitions.
[2024-02-28 20:53:55,517 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 38 states, 37 states have (on average 68.91891891891892) internal successors, (2550), 37 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:55,521 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:55,521 INFO  L81            ComplementDD]: Finished complementDD. Result  has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:53:55,522 INFO  L175             Difference]: Start difference. First operand has 283 places, 1804 transitions, 25440 flow. Second operand 37 states and 2550 transitions.
[2024-02-28 20:53:55,522 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 3734 transitions, 59987 flow
[2024-02-28 20:54:05,641 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 3734 transitions, 59733 flow, removed 100 selfloop flow, removed 17 redundant places.
[2024-02-28 20:54:05,685 INFO  L231             Difference]: Finished difference. Result has 322 places, 2617 transitions, 44520 flow
[2024-02-28 20:54:05,686 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=25278, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=572, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1073, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=44520, PETRI_PLACES=322, PETRI_TRANSITIONS=2617}
[2024-02-28 20:54:05,686 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 203 predicate places.
[2024-02-28 20:54:05,686 INFO  L495      AbstractCegarLoop]: Abstraction has has 322 places, 2617 transitions, 44520 flow
[2024-02-28 20:54:05,687 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 52.96875) internal successors, (1695), 32 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:54:05,687 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:54:05,687 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:54:05,702 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-02-28 20:54:05,888 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:54:05,888 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:54:05,889 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:54:05,889 INFO  L85        PathProgramCache]: Analyzing trace with hash -382662763, now seen corresponding path program 3 times
[2024-02-28 20:54:05,889 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:54:05,890 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969528004]
[2024-02-28 20:54:05,890 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:54:05,890 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:54:05,908 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:54:06,180 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:54:06,181 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:54:06,181 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969528004]
[2024-02-28 20:54:06,181 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969528004] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:54:06,181 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959520351]
[2024-02-28 20:54:06,181 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-02-28 20:54:06,182 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:54:06,182 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:54:06,183 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:54:06,195 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-02-28 20:54:06,288 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-02-28 20:54:06,289 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:54:06,290 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-02-28 20:54:06,294 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:54:06,302 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:54:06,344 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 20:54:06,344 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 20:54:06,502 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 20:54:06,584 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-02-28 20:54:06,624 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-02-28 20:54:06,667 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-02-28 20:54:06,727 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:54:06,763 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:54:06,764 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:54:06,783 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2024-02-28 20:54:06,808 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)))))) is different from false
[2024-02-28 20:54:06,829 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2024-02-28 20:54:06,846 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false
[2024-02-28 20:54:06,901 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse2 0) .cse4 0)))) (and (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_634 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_634) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false
[2024-02-28 20:54:06,917 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:54:06,918 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2024-02-28 20:54:06,924 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:54:06,924 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2024-02-28 20:54:06,928 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2024-02-28 20:54:06,938 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 20:54:06,938 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-02-28 20:54:06,945 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 20:54:06,945 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-02-28 20:54:06,950 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 20:54:06,950 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2024-02-28 20:54:07,009 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:54:07,009 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [959520351] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:54:07,009 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:54:07,009 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 33
[2024-02-28 20:54:07,009 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577893807]
[2024-02-28 20:54:07,009 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:54:07,010 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 34 states
[2024-02-28 20:54:07,010 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:54:07,010 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2024-02-28 20:54:07,011 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=719, Unknown=5, NotChecked=290, Total=1122
[2024-02-28 20:54:07,074 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 51 out of 119
[2024-02-28 20:54:07,076 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 2617 transitions, 44520 flow. Second operand  has 34 states, 34 states have (on average 52.970588235294116) internal successors, (1801), 34 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:54:07,076 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:54:07,076 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 119
[2024-02-28 20:54:07,076 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:54:46,153 INFO  L124   PetriNetUnfolderBase]: 41283/81076 cut-off events.
[2024-02-28 20:54:46,154 INFO  L125   PetriNetUnfolderBase]: For 1184893/1185563 co-relation queries the response was YES.
[2024-02-28 20:54:47,042 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 517191 conditions, 81076 events. 41283/81076 cut-off events. For 1184893/1185563 co-relation queries the response was YES. Maximal size of possible extension queue 2233. Compared 816500 event pairs, 4308 based on Foata normal form. 399/77945 useless extension candidates. Maximal degree in co-relation 514334. Up to 30004 conditions per place. 
[2024-02-28 20:54:47,417 INFO  L140   encePairwiseOnDemand]: 83/119 looper letters, 2623 selfloop transitions, 2150 changer transitions 35/4873 dead transitions.
[2024-02-28 20:54:47,417 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 4873 transitions, 90219 flow
[2024-02-28 20:54:47,418 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. 
[2024-02-28 20:54:47,418 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 40 states.
[2024-02-28 20:54:47,419 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 2742 transitions.
[2024-02-28 20:54:47,420 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5760504201680672
[2024-02-28 20:54:47,420 INFO  L72            ComplementDD]: Start complementDD. Operand 40 states and 2742 transitions.
[2024-02-28 20:54:47,420 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 40 states and 2742 transitions.
[2024-02-28 20:54:47,421 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:54:47,421 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 2742 transitions.
[2024-02-28 20:54:47,424 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 41 states, 40 states have (on average 68.55) internal successors, (2742), 40 states have internal predecessors, (2742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:54:47,428 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 41 states, 41 states have (on average 119.0) internal successors, (4879), 41 states have internal predecessors, (4879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:54:47,429 INFO  L81            ComplementDD]: Finished complementDD. Result  has 41 states, 41 states have (on average 119.0) internal successors, (4879), 41 states have internal predecessors, (4879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:54:47,429 INFO  L175             Difference]: Start difference. First operand has 322 places, 2617 transitions, 44520 flow. Second operand 40 states and 2742 transitions.
[2024-02-28 20:54:47,429 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 4873 transitions, 90219 flow
[2024-02-28 20:55:07,454 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 4873 transitions, 89529 flow, removed 297 selfloop flow, removed 14 redundant places.
[2024-02-28 20:55:07,522 INFO  L231             Difference]: Finished difference. Result has 368 places, 3656 transitions, 73189 flow
[2024-02-28 20:55:07,524 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=44102, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=73189, PETRI_PLACES=368, PETRI_TRANSITIONS=3656}
[2024-02-28 20:55:07,524 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 249 predicate places.
[2024-02-28 20:55:07,524 INFO  L495      AbstractCegarLoop]: Abstraction has has 368 places, 3656 transitions, 73189 flow
[2024-02-28 20:55:07,525 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 34 states, 34 states have (on average 52.970588235294116) internal successors, (1801), 34 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:55:07,525 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:55:07,525 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:55:07,532 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-02-28 20:55:07,726 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2024-02-28 20:55:07,726 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:55:07,727 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:55:07,727 INFO  L85        PathProgramCache]: Analyzing trace with hash 1347307557, now seen corresponding path program 4 times
[2024-02-28 20:55:07,727 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:55:07,727 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401697690]
[2024-02-28 20:55:07,727 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:55:07,728 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:55:07,746 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:55:08,058 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:55:08,058 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:55:08,058 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401697690]
[2024-02-28 20:55:08,058 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401697690] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:55:08,058 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459124934]
[2024-02-28 20:55:08,058 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-02-28 20:55:08,058 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:55:08,059 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:55:08,059 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:55:08,062 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-02-28 20:55:08,215 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-02-28 20:55:08,215 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:55:08,217 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 45 conjunts are in the unsatisfiable core
[2024-02-28 20:55:08,228 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:55:08,234 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:55:08,296 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 20:55:08,297 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 20:55:08,531 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 20:55:08,566 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-02-28 20:55:08,616 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-02-28 20:55:08,766 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-02-28 20:55:08,822 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41
[2024-02-28 20:55:08,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:55:08,860 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:55:31,131 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:55:31,132 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459124934] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:55:31,132 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:55:31,132 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 38
[2024-02-28 20:55:31,132 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819375121]
[2024-02-28 20:55:31,132 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:55:31,133 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 39 states
[2024-02-28 20:55:31,133 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:55:31,134 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2024-02-28 20:55:31,134 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1299, Unknown=5, NotChecked=0, Total=1482
[2024-02-28 20:55:35,579 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:55:41,830 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:55:46,480 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:55:51,065 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:55:55,488 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:55:59,585 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:56:04,583 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:56:08,813 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:56:13,153 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:56:17,658 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:56:22,241 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:56:26,646 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:56:32,515 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:56:37,422 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:56:42,324 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:56:46,610 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:56:49,970 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:56:54,558 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:56:58,890 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:57:03,797 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:57:08,472 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:57:13,203 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:57:17,420 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:57:22,451 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:57:26,482 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 20:57:26,482 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 51 out of 119
[2024-02-28 20:57:26,484 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 3656 transitions, 73189 flow. Second operand  has 39 states, 39 states have (on average 53.1025641025641) internal successors, (2071), 39 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:57:26,484 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:57:26,484 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 119
[2024-02-28 20:57:26,484 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:58:43,595 INFO  L124   PetriNetUnfolderBase]: 46962/92457 cut-off events.
[2024-02-28 20:58:43,595 INFO  L125   PetriNetUnfolderBase]: For 1991238/1992275 co-relation queries the response was YES.
[2024-02-28 20:58:45,135 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 646838 conditions, 92457 events. 46962/92457 cut-off events. For 1991238/1992275 co-relation queries the response was YES. Maximal size of possible extension queue 2541. Compared 949395 event pairs, 4682 based on Foata normal form. 381/88871 useless extension candidates. Maximal degree in co-relation 642984. Up to 34570 conditions per place. 
[2024-02-28 20:58:45,621 INFO  L140   encePairwiseOnDemand]: 83/119 looper letters, 2996 selfloop transitions, 2313 changer transitions 38/5412 dead transitions.
[2024-02-28 20:58:45,622 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 5412 transitions, 114848 flow
[2024-02-28 20:58:45,623 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. 
[2024-02-28 20:58:45,623 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 40 states.
[2024-02-28 20:58:45,624 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 2734 transitions.
[2024-02-28 20:58:45,625 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5743697478991596
[2024-02-28 20:58:45,625 INFO  L72            ComplementDD]: Start complementDD. Operand 40 states and 2734 transitions.
[2024-02-28 20:58:45,625 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 40 states and 2734 transitions.
[2024-02-28 20:58:45,626 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:58:45,626 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 2734 transitions.
[2024-02-28 20:58:45,629 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 41 states, 40 states have (on average 68.35) internal successors, (2734), 40 states have internal predecessors, (2734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:58:45,632 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 41 states, 41 states have (on average 119.0) internal successors, (4879), 41 states have internal predecessors, (4879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:58:45,633 INFO  L81            ComplementDD]: Finished complementDD. Result  has 41 states, 41 states have (on average 119.0) internal successors, (4879), 41 states have internal predecessors, (4879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:58:45,633 INFO  L175             Difference]: Start difference. First operand has 368 places, 3656 transitions, 73189 flow. Second operand 40 states and 2734 transitions.
[2024-02-28 20:58:45,633 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 5412 transitions, 114848 flow
[2024-02-28 20:59:18,943 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 5412 transitions, 111590 flow, removed 1568 selfloop flow, removed 15 redundant places.
[2024-02-28 20:59:19,025 INFO  L231             Difference]: Finished difference. Result has 412 places, 4308 transitions, 94931 flow
[2024-02-28 20:59:19,028 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=70607, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1703, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=94931, PETRI_PLACES=412, PETRI_TRANSITIONS=4308}
[2024-02-28 20:59:19,028 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 293 predicate places.
[2024-02-28 20:59:19,028 INFO  L495      AbstractCegarLoop]: Abstraction has has 412 places, 4308 transitions, 94931 flow
[2024-02-28 20:59:19,028 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 39 states, 39 states have (on average 53.1025641025641) internal successors, (2071), 39 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:59:19,029 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:59:19,029 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:59:19,035 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-02-28 20:59:19,230 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:59:19,230 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 20:59:19,231 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:59:19,231 INFO  L85        PathProgramCache]: Analyzing trace with hash -1099062149, now seen corresponding path program 5 times
[2024-02-28 20:59:19,231 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:59:19,231 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478054773]
[2024-02-28 20:59:19,232 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:59:19,232 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:59:19,250 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:59:19,723 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:59:19,724 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:59:19,724 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478054773]
[2024-02-28 20:59:19,724 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478054773] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:59:19,724 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488433685]
[2024-02-28 20:59:19,725 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-02-28 20:59:19,725 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:59:19,725 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:59:19,727 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:59:19,729 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-02-28 20:59:19,829 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 20:59:19,829 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:59:19,831 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 42 conjunts are in the unsatisfiable core
[2024-02-28 20:59:19,835 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:59:19,981 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:59:20,158 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 20:59:20,159 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 20:59:20,434 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 20:59:20,507 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-02-28 20:59:20,687 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-02-28 20:59:20,777 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-02-28 20:59:20,897 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:59:20,968 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:59:20,968 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:59:21,006 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2024-02-28 20:59:21,488 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_810 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_810) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2024-02-28 20:59:21,743 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:59:21,744 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2024-02-28 20:59:21,750 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:59:21,751 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2024-02-28 20:59:21,755 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2024-02-28 20:59:21,770 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 20:59:21,770 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-02-28 20:59:21,777 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 20:59:21,778 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2024-02-28 20:59:21,785 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 20:59:21,786 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-02-28 20:59:21,991 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:59:21,992 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488433685] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:59:21,992 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:59:21,992 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 15] total 39
[2024-02-28 20:59:21,992 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953525330]
[2024-02-28 20:59:21,992 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:59:21,993 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2024-02-28 20:59:21,994 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:59:21,994 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2024-02-28 20:59:21,995 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1234, Unknown=33, NotChecked=146, Total=1560
[2024-02-28 20:59:22,787 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 38 out of 119
[2024-02-28 20:59:22,788 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 4308 transitions, 94931 flow. Second operand  has 40 states, 40 states have (on average 40.275) internal successors, (1611), 40 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:59:22,789 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:59:22,789 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 119
[2024-02-28 20:59:22,789 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:00:52,297 INFO  L124   PetriNetUnfolderBase]: 52735/103490 cut-off events.
[2024-02-28 21:00:52,298 INFO  L125   PetriNetUnfolderBase]: For 2409933/2411045 co-relation queries the response was YES.
[2024-02-28 21:00:54,265 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 753573 conditions, 103490 events. 52735/103490 cut-off events. For 2409933/2411045 co-relation queries the response was YES. Maximal size of possible extension queue 2772. Compared 1073412 event pairs, 4974 based on Foata normal form. 525/99560 useless extension candidates. Maximal degree in co-relation 748473. Up to 38943 conditions per place. 
[2024-02-28 21:00:54,817 INFO  L140   encePairwiseOnDemand]: 74/119 looper letters, 3317 selfloop transitions, 2903 changer transitions 40/6310 dead transitions.
[2024-02-28 21:00:54,818 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 6310 transitions, 144714 flow
[2024-02-28 21:00:54,819 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. 
[2024-02-28 21:00:54,819 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 50 states.
[2024-02-28 21:00:54,821 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 2670 transitions.
[2024-02-28 21:00:54,822 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44873949579831934
[2024-02-28 21:00:54,822 INFO  L72            ComplementDD]: Start complementDD. Operand 50 states and 2670 transitions.
[2024-02-28 21:00:54,822 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 50 states and 2670 transitions.
[2024-02-28 21:00:54,822 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:00:54,822 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 2670 transitions.
[2024-02-28 21:00:54,825 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 51 states, 50 states have (on average 53.4) internal successors, (2670), 50 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:00:54,829 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 51 states, 51 states have (on average 119.0) internal successors, (6069), 51 states have internal predecessors, (6069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:00:54,830 INFO  L81            ComplementDD]: Finished complementDD. Result  has 51 states, 51 states have (on average 119.0) internal successors, (6069), 51 states have internal predecessors, (6069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:00:54,830 INFO  L175             Difference]: Start difference. First operand has 412 places, 4308 transitions, 94931 flow. Second operand 50 states and 2670 transitions.
[2024-02-28 21:00:54,830 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 6310 transitions, 144714 flow
[2024-02-28 21:01:43,549 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 6310 transitions, 143297 flow, removed 618 selfloop flow, removed 18 redundant places.
[2024-02-28 21:01:43,654 INFO  L231             Difference]: Finished difference. Result has 463 places, 5049 transitions, 123932 flow
[2024-02-28 21:01:43,656 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=93842, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2217, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1770, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=123932, PETRI_PLACES=463, PETRI_TRANSITIONS=5049}
[2024-02-28 21:01:43,657 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 344 predicate places.
[2024-02-28 21:01:43,657 INFO  L495      AbstractCegarLoop]: Abstraction has has 463 places, 5049 transitions, 123932 flow
[2024-02-28 21:01:43,657 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 40 states, 40 states have (on average 40.275) internal successors, (1611), 40 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:01:43,657 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:01:43,658 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:01:43,662 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-02-28 21:01:43,862 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2024-02-28 21:01:43,863 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 21:01:43,863 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:01:43,864 INFO  L85        PathProgramCache]: Analyzing trace with hash -1375956209, now seen corresponding path program 6 times
[2024-02-28 21:01:43,864 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:01:43,864 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518150030]
[2024-02-28 21:01:43,865 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:01:43,865 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:01:43,883 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:01:44,336 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:01:44,336 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:01:44,337 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518150030]
[2024-02-28 21:01:44,337 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518150030] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 21:01:44,337 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808768466]
[2024-02-28 21:01:44,337 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-02-28 21:01:44,338 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 21:01:44,338 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 21:01:44,339 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 21:01:44,340 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-02-28 21:01:44,474 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2024-02-28 21:01:44,474 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 21:01:44,476 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-02-28 21:01:44,482 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 21:01:44,488 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 21:01:44,568 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 21:01:44,569 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 21:01:44,813 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 21:01:44,859 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-02-28 21:01:44,916 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-02-28 21:01:45,001 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-02-28 21:01:45,287 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 21:01:45,350 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:01:45,350 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 21:01:45,380 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)))) is different from false
[2024-02-28 21:01:45,577 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)))) is different from false
[2024-02-28 21:01:45,602 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_898 (Array Int Int))) (= 0 (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)))))) is different from false
[2024-02-28 21:01:45,625 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= 0 (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2024-02-28 21:01:45,657 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) (.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse4 0) .cse3 0)))) (and (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_898 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_898) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false
[2024-02-28 21:01:45,682 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 21:01:45,683 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66
[2024-02-28 21:01:45,689 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 21:01:45,690 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 38
[2024-02-28 21:01:45,694 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3
[2024-02-28 21:01:45,704 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 21:01:45,704 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-02-28 21:01:45,713 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 21:01:45,714 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-02-28 21:01:45,721 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 21:01:45,721 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-02-28 21:01:45,835 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:01:45,836 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808768466] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 21:01:45,836 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 21:01:45,836 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 34
[2024-02-28 21:01:45,837 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021941719]
[2024-02-28 21:01:45,837 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 21:01:45,838 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2024-02-28 21:01:45,839 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:01:45,839 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2024-02-28 21:01:45,840 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=744, Unknown=16, NotChecked=300, Total=1190
[2024-02-28 21:01:45,950 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 51 out of 119
[2024-02-28 21:01:45,952 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 5049 transitions, 123932 flow. Second operand  has 35 states, 35 states have (on average 52.94285714285714) internal successors, (1853), 35 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:01:45,952 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:01:45,953 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 119
[2024-02-28 21:01:45,953 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 21:03:45,134 INFO  L124   PetriNetUnfolderBase]: 56554/112260 cut-off events.
[2024-02-28 21:03:45,135 INFO  L125   PetriNetUnfolderBase]: For 2915860/2917036 co-relation queries the response was YES.
[2024-02-28 21:03:47,519 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 851342 conditions, 112260 events. 56554/112260 cut-off events. For 2915860/2917036 co-relation queries the response was YES. Maximal size of possible extension queue 3092. Compared 1191150 event pairs, 6351 based on Foata normal form. 472/107986 useless extension candidates. Maximal degree in co-relation 845800. Up to 57747 conditions per place. 
[2024-02-28 21:03:48,132 INFO  L140   encePairwiseOnDemand]: 83/119 looper letters, 3071 selfloop transitions, 2882 changer transitions 34/6053 dead transitions.
[2024-02-28 21:03:48,132 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 6053 transitions, 156988 flow
[2024-02-28 21:03:48,133 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2024-02-28 21:03:48,133 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 29 states.
[2024-02-28 21:03:48,134 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1937 transitions.
[2024-02-28 21:03:48,135 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5612865835989568
[2024-02-28 21:03:48,135 INFO  L72            ComplementDD]: Start complementDD. Operand 29 states and 1937 transitions.
[2024-02-28 21:03:48,135 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 29 states and 1937 transitions.
[2024-02-28 21:03:48,136 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 21:03:48,136 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 1937 transitions.
[2024-02-28 21:03:48,138 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 30 states, 29 states have (on average 66.79310344827586) internal successors, (1937), 29 states have internal predecessors, (1937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:03:48,140 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 30 states, 30 states have (on average 119.0) internal successors, (3570), 30 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:03:48,141 INFO  L81            ComplementDD]: Finished complementDD. Result  has 30 states, 30 states have (on average 119.0) internal successors, (3570), 30 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:03:48,141 INFO  L175             Difference]: Start difference. First operand has 463 places, 5049 transitions, 123932 flow. Second operand 29 states and 1937 transitions.
[2024-02-28 21:03:48,141 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 6053 transitions, 156988 flow
[2024-02-28 21:04:54,279 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 6053 transitions, 155596 flow, removed 626 selfloop flow, removed 20 redundant places.
[2024-02-28 21:04:54,386 INFO  L231             Difference]: Finished difference. Result has 487 places, 5570 transitions, 148812 flow
[2024-02-28 21:04:54,389 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=122552, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5049, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2370, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=148812, PETRI_PLACES=487, PETRI_TRANSITIONS=5570}
[2024-02-28 21:04:54,390 INFO  L281   CegarLoopForPetriNet]: 119 programPoint places, 368 predicate places.
[2024-02-28 21:04:54,390 INFO  L495      AbstractCegarLoop]: Abstraction has has 487 places, 5570 transitions, 148812 flow
[2024-02-28 21:04:54,390 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 52.94285714285714) internal successors, (1853), 35 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:04:54,391 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 21:04:54,391 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 21:04:54,398 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-02-28 21:04:54,591 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-02-28 21:04:54,592 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-02-28 21:04:54,593 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 21:04:54,593 INFO  L85        PathProgramCache]: Analyzing trace with hash -1035463933, now seen corresponding path program 7 times
[2024-02-28 21:04:54,593 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 21:04:54,593 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545221986]
[2024-02-28 21:04:54,594 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 21:04:54,594 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 21:04:54,620 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:04:55,024 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:04:55,024 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 21:04:55,025 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545221986]
[2024-02-28 21:04:55,025 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545221986] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 21:04:55,025 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11218037]
[2024-02-28 21:04:55,025 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-02-28 21:04:55,026 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 21:04:55,026 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 21:04:55,027 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 21:04:55,028 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-02-28 21:04:55,155 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 21:04:55,156 INFO  L262         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 43 conjunts are in the unsatisfiable core
[2024-02-28 21:04:55,159 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 21:04:55,287 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 21:04:55,461 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-02-28 21:04:55,462 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-02-28 21:04:55,705 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 21:04:55,892 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-02-28 21:04:55,958 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-02-28 21:04:56,034 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-02-28 21:04:56,139 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 21:04:56,202 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:04:56,202 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 21:04:56,233 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)))) is different from false
[2024-02-28 21:04:56,937 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~arg.base v_ArrVal_986) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false
[2024-02-28 21:04:57,229 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 21:04:57,230 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2024-02-28 21:04:57,236 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 21:04:57,236 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2024-02-28 21:04:57,240 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2024-02-28 21:04:57,248 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 21:04:57,249 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-02-28 21:04:57,256 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 21:04:57,257 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-02-28 21:04:57,264 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 21:04:57,265 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2024-02-28 21:04:57,478 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 21:04:57,479 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [11218037] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 21:04:57,479 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 21:04:57,480 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 15] total 40
[2024-02-28 21:04:57,480 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142798412]
[2024-02-28 21:04:57,480 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 21:04:57,481 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 41 states
[2024-02-28 21:04:57,481 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 21:04:57,482 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants.
[2024-02-28 21:04:57,483 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1278, Unknown=55, NotChecked=150, Total=1640
[2024-02-28 21:04:57,944 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 38 out of 119
[2024-02-28 21:04:57,945 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 5570 transitions, 148812 flow. Second operand  has 41 states, 41 states have (on average 40.24390243902439) internal successors, (1650), 41 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 21:04:57,945 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 21:04:57,946 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 119
[2024-02-28 21:04:57,946 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15
