./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-index-bitmask.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-index-bitmask.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 a441762343d84352dee3940528743ce1ce7d37c630412cca6e4cb7a13e64a176
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-12 00:42:02,254 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-12 00:42:02,299 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-12 00:42:02,302 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-12 00:42:02,303 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-12 00:42:02,320 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-12 00:42:02,321 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-12 00:42:02,321 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-12 00:42:02,322 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-12 00:42:02,322 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-12 00:42:02,323 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-12 00:42:02,323 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-12 00:42:02,323 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-12 00:42:02,324 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-12 00:42:02,324 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-12 00:42:02,324 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-12 00:42:02,325 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-12 00:42:02,325 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-12 00:42:02,325 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-12 00:42:02,326 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-12 00:42:02,326 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-12 00:42:02,326 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-12 00:42:02,327 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-12 00:42:02,327 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-12 00:42:02,327 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-12 00:42:02,327 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-12 00:42:02,328 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-12 00:42:02,328 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-12 00:42:02,328 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-12 00:42:02,328 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-12 00:42:02,329 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 00:42:02,329 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-12 00:42:02,329 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-12 00:42:02,330 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-12 00:42:02,330 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-12 00:42:02,330 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-12 00:42:02,330 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-12 00:42:02,330 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-12 00:42:02,331 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-12 00:42:02,331 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-12 00:42:02,331 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-12 00:42:02,331 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 -> a441762343d84352dee3940528743ce1ce7d37c630412cca6e4cb7a13e64a176
[2024-03-12 00:42:02,505 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-12 00:42:02,521 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-12 00:42:02,523 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-12 00:42:02,524 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-12 00:42:02,524 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-12 00:42:02,525 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask.i
[2024-03-12 00:42:03,543 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-12 00:42:03,730 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-12 00:42:03,730 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask.i
[2024-03-12 00:42:03,742 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/b9c310e2a/0363d53e29a743cb905333dafd087825/FLAG4401bac46
[2024-03-12 00:42:03,753 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/b9c310e2a/0363d53e29a743cb905333dafd087825
[2024-03-12 00:42:03,755 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-12 00:42:03,756 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-12 00:42:03,756 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-12 00:42:03,757 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-12 00:42:03,760 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-12 00:42:03,761 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 12:42:03" (1/1) ...
[2024-03-12 00:42:03,762 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bbabbb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:42:03, skipping insertion in model container
[2024-03-12 00:42:03,762 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 12:42:03" (1/1) ...
[2024-03-12 00:42:03,799 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-12 00:42:04,076 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 00:42:04,086 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-12 00:42:04,122 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 00:42:04,157 WARN  L675               CHandler]: The function ffs is called, but not defined or handled by StandardFunctionHandler.
[2024-03-12 00:42:04,162 INFO  L206         MainTranslator]: Completed translation
[2024-03-12 00:42:04,163 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:42:04 WrapperNode
[2024-03-12 00:42:04,163 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-12 00:42:04,164 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-12 00:42:04,164 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-12 00:42:04,164 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-12 00:42:04,169 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:42:04" (1/1) ...
[2024-03-12 00:42:04,185 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:42:04" (1/1) ...
[2024-03-12 00:42:04,205 INFO  L138                Inliner]: procedures = 281, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132
[2024-03-12 00:42:04,205 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-12 00:42:04,206 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-12 00:42:04,206 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-12 00:42:04,206 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-12 00:42:04,214 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:42:04" (1/1) ...
[2024-03-12 00:42:04,214 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:42:04" (1/1) ...
[2024-03-12 00:42:04,218 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:42:04" (1/1) ...
[2024-03-12 00:42:04,218 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:42:04" (1/1) ...
[2024-03-12 00:42:04,225 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:42:04" (1/1) ...
[2024-03-12 00:42:04,227 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:42:04" (1/1) ...
[2024-03-12 00:42:04,229 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:42:04" (1/1) ...
[2024-03-12 00:42:04,230 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:42:04" (1/1) ...
[2024-03-12 00:42:04,233 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-12 00:42:04,233 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-12 00:42:04,234 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-12 00:42:04,234 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-12 00:42:04,234 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:42:04" (1/1) ...
[2024-03-12 00:42:04,239 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 00:42:04,246 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:42:04,270 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-03-12 00:42:04,274 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-03-12 00:42:04,298 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-12 00:42:04,298 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-12 00:42:04,298 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-12 00:42:04,298 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-12 00:42:04,299 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-03-12 00:42:04,299 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-12 00:42:04,299 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-12 00:42:04,299 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-03-12 00:42:04,299 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-12 00:42:04,299 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-03-12 00:42:04,300 INFO  L130     BoogieDeclarations]: Found specification of procedure ffs
[2024-03-12 00:42:04,300 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-03-12 00:42:04,300 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-12 00:42:04,300 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-12 00:42:04,300 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-12 00:42:04,300 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-12 00:42:04,302 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-12 00:42:04,423 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-12 00:42:04,425 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-12 00:42:04,712 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-12 00:42:04,728 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-12 00:42:04,729 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-12 00:42:04,730 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 12:42:04 BoogieIcfgContainer
[2024-03-12 00:42:04,730 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-12 00:42:04,732 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-12 00:42:04,732 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-12 00:42:04,735 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-12 00:42:04,735 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.03 12:42:03" (1/3) ...
[2024-03-12 00:42:04,735 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eeced7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 12:42:04, skipping insertion in model container
[2024-03-12 00:42:04,736 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:42:04" (2/3) ...
[2024-03-12 00:42:04,736 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eeced7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 12:42:04, skipping insertion in model container
[2024-03-12 00:42:04,736 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 12:42:04" (3/3) ...
[2024-03-12 00:42:04,737 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask.i
[2024-03-12 00:42:04,743 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-12 00:42:04,750 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-12 00:42:04,751 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations.
[2024-03-12 00:42:04,751 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-12 00:42:04,803 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-12 00:42:04,829 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 190 places, 198 transitions, 403 flow
[2024-03-12 00:42:04,894 INFO  L124   PetriNetUnfolderBase]: 16/287 cut-off events.
[2024-03-12 00:42:04,894 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-12 00:42:04,899 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 292 conditions, 287 events. 16/287 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 619 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 144. Up to 6 conditions per place. 
[2024-03-12 00:42:04,900 INFO  L82        GeneralOperation]: Start removeDead. Operand has 190 places, 198 transitions, 403 flow
[2024-03-12 00:42:04,904 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 190 places, 198 transitions, 403 flow
[2024-03-12 00:42:04,911 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 00:42:04,916 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;@4fd38098, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 00:42:04,917 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2024-03-12 00:42:04,923 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 00:42:04,923 INFO  L124   PetriNetUnfolderBase]: 2/41 cut-off events.
[2024-03-12 00:42:04,923 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 00:42:04,923 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:04,924 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]
[2024-03-12 00:42:04,924 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:04,928 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:04,928 INFO  L85        PathProgramCache]: Analyzing trace with hash 2042425697, now seen corresponding path program 1 times
[2024-03-12 00:42:04,935 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:04,935 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192351242]
[2024-03-12 00:42:04,935 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:04,936 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:05,018 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:05,114 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:05,114 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:05,114 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192351242]
[2024-03-12 00:42:05,115 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192351242] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:05,115 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:05,116 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:42:05,117 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895861552]
[2024-03-12 00:42:05,117 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:05,124 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:42:05,128 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:05,147 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:42:05,148 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:42:05,186 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-03-12 00:42:05,189 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 198 transitions, 403 flow. Second operand  has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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-03-12 00:42:05,189 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:05,189 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-03-12 00:42:05,190 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:05,276 INFO  L124   PetriNetUnfolderBase]: 34/480 cut-off events.
[2024-03-12 00:42:05,276 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-12 00:42:05,278 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 528 conditions, 480 events. 34/480 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1821 event pairs, 12 based on Foata normal form. 10/421 useless extension candidates. Maximal degree in co-relation 373. Up to 41 conditions per place. 
[2024-03-12 00:42:05,280 INFO  L140   encePairwiseOnDemand]: 191/198 looper letters, 12 selfloop transitions, 2 changer transitions 2/193 dead transitions.
[2024-03-12 00:42:05,281 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 193 transitions, 421 flow
[2024-03-12 00:42:05,282 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:42:05,284 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:42:05,290 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions.
[2024-03-12 00:42:05,293 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.936026936026936
[2024-03-12 00:42:05,293 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 556 transitions.
[2024-03-12 00:42:05,294 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions.
[2024-03-12 00:42:05,295 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:05,297 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions.
[2024-03-12 00:42:05,300 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 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-03-12 00:42:05,305 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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-03-12 00:42:05,306 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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-03-12 00:42:05,307 INFO  L175             Difference]: Start difference. First operand has 190 places, 198 transitions, 403 flow. Second operand 3 states and 556 transitions.
[2024-03-12 00:42:05,308 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 193 transitions, 421 flow
[2024-03-12 00:42:05,311 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 193 transitions, 421 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:42:05,315 INFO  L231             Difference]: Finished difference. Result has 191 places, 191 transitions, 393 flow
[2024-03-12 00:42:05,317 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=191, PETRI_TRANSITIONS=191}
[2024-03-12 00:42:05,320 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 1 predicate places.
[2024-03-12 00:42:05,321 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 191 transitions, 393 flow
[2024-03-12 00:42:05,321 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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-03-12 00:42:05,322 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:05,322 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]
[2024-03-12 00:42:05,322 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-12 00:42:05,323 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:05,323 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:05,323 INFO  L85        PathProgramCache]: Analyzing trace with hash -103642509, now seen corresponding path program 1 times
[2024-03-12 00:42:05,324 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:05,324 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661864612]
[2024-03-12 00:42:05,324 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:05,324 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:05,344 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:05,384 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:05,384 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:05,385 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661864612]
[2024-03-12 00:42:05,385 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661864612] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:05,385 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:05,385 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:42:05,385 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386698311]
[2024-03-12 00:42:05,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:05,387 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:42:05,387 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:05,387 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:42:05,388 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:42:05,409 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 198
[2024-03-12 00:42:05,410 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 191 transitions, 393 flow. Second operand  has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 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-03-12 00:42:05,411 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:05,411 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 198
[2024-03-12 00:42:05,411 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:05,503 INFO  L124   PetriNetUnfolderBase]: 87/676 cut-off events.
[2024-03-12 00:42:05,504 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-12 00:42:05,506 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 803 conditions, 676 events. 87/676 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3260 event pairs, 17 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 757. Up to 64 conditions per place. 
[2024-03-12 00:42:05,508 INFO  L140   encePairwiseOnDemand]: 187/198 looper letters, 21 selfloop transitions, 8 changer transitions 0/203 dead transitions.
[2024-03-12 00:42:05,508 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 203 transitions, 475 flow
[2024-03-12 00:42:05,508 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:42:05,508 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:42:05,510 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions.
[2024-03-12 00:42:05,510 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9478114478114478
[2024-03-12 00:42:05,510 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 563 transitions.
[2024-03-12 00:42:05,510 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 563 transitions.
[2024-03-12 00:42:05,511 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:05,511 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 563 transitions.
[2024-03-12 00:42:05,512 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 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-03-12 00:42:05,514 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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-03-12 00:42:05,514 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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-03-12 00:42:05,514 INFO  L175             Difference]: Start difference. First operand has 191 places, 191 transitions, 393 flow. Second operand 3 states and 563 transitions.
[2024-03-12 00:42:05,515 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 203 transitions, 475 flow
[2024-03-12 00:42:05,517 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 203 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:42:05,520 INFO  L231             Difference]: Finished difference. Result has 191 places, 199 transitions, 459 flow
[2024-03-12 00:42:05,520 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=459, PETRI_PLACES=191, PETRI_TRANSITIONS=199}
[2024-03-12 00:42:05,521 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 1 predicate places.
[2024-03-12 00:42:05,521 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 199 transitions, 459 flow
[2024-03-12 00:42:05,522 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 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-03-12 00:42:05,522 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:05,522 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]
[2024-03-12 00:42:05,522 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-12 00:42:05,523 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:05,523 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:05,524 INFO  L85        PathProgramCache]: Analyzing trace with hash -1853499857, now seen corresponding path program 1 times
[2024-03-12 00:42:05,524 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:05,524 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697851334]
[2024-03-12 00:42:05,524 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:05,525 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:05,552 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:05,642 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:05,642 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:05,643 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697851334]
[2024-03-12 00:42:05,643 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697851334] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:05,643 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:05,643 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:42:05,643 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496388875]
[2024-03-12 00:42:05,644 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:05,644 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 00:42:05,644 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:05,645 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 00:42:05,645 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 00:42:05,705 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 198
[2024-03-12 00:42:05,706 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 199 transitions, 459 flow. Second operand  has 5 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 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-03-12 00:42:05,706 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:05,706 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 198
[2024-03-12 00:42:05,707 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:05,799 INFO  L124   PetriNetUnfolderBase]: 68/710 cut-off events.
[2024-03-12 00:42:05,799 INFO  L125   PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES.
[2024-03-12 00:42:05,800 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 874 conditions, 710 events. 68/710 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3449 event pairs, 7 based on Foata normal form. 1/622 useless extension candidates. Maximal degree in co-relation 685. Up to 61 conditions per place. 
[2024-03-12 00:42:05,802 INFO  L140   encePairwiseOnDemand]: 190/198 looper letters, 19 selfloop transitions, 6 changer transitions 1/208 dead transitions.
[2024-03-12 00:42:05,802 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 208 transitions, 529 flow
[2024-03-12 00:42:05,803 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:42:05,803 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:42:05,804 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1089 transitions.
[2024-03-12 00:42:05,805 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9166666666666666
[2024-03-12 00:42:05,805 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1089 transitions.
[2024-03-12 00:42:05,805 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1089 transitions.
[2024-03-12 00:42:05,806 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:05,806 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1089 transitions.
[2024-03-12 00:42:05,808 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 181.5) internal successors, (1089), 6 states have internal predecessors, (1089), 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-03-12 00:42:05,810 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 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-03-12 00:42:05,811 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 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-03-12 00:42:05,811 INFO  L175             Difference]: Start difference. First operand has 191 places, 199 transitions, 459 flow. Second operand 6 states and 1089 transitions.
[2024-03-12 00:42:05,811 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 208 transitions, 529 flow
[2024-03-12 00:42:05,813 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 208 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:42:05,816 INFO  L231             Difference]: Finished difference. Result has 198 places, 203 transitions, 485 flow
[2024-03-12 00:42:05,816 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=485, PETRI_PLACES=198, PETRI_TRANSITIONS=203}
[2024-03-12 00:42:05,816 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 8 predicate places.
[2024-03-12 00:42:05,817 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 203 transitions, 485 flow
[2024-03-12 00:42:05,817 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 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-03-12 00:42:05,817 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:05,818 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]
[2024-03-12 00:42:05,818 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-12 00:42:05,818 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:05,818 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:05,819 INFO  L85        PathProgramCache]: Analyzing trace with hash 1513540216, now seen corresponding path program 1 times
[2024-03-12 00:42:05,819 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:05,819 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486803034]
[2024-03-12 00:42:05,819 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:05,819 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:05,835 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:06,127 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:06,127 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:06,127 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486803034]
[2024-03-12 00:42:06,128 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486803034] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:06,128 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:06,128 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:42:06,128 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176537260]
[2024-03-12 00:42:06,128 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:06,129 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:42:06,129 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:06,129 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:42:06,130 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:42:06,334 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198
[2024-03-12 00:42:06,335 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 203 transitions, 485 flow. Second operand  has 6 states, 6 states have (on average 163.16666666666666) internal successors, (979), 6 states have internal predecessors, (979), 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-03-12 00:42:06,335 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:06,336 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198
[2024-03-12 00:42:06,336 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:06,601 INFO  L124   PetriNetUnfolderBase]: 300/1732 cut-off events.
[2024-03-12 00:42:06,601 INFO  L125   PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES.
[2024-03-12 00:42:06,605 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2381 conditions, 1732 events. 300/1732 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 12671 event pairs, 35 based on Foata normal form. 0/1526 useless extension candidates. Maximal degree in co-relation 2225. Up to 300 conditions per place. 
[2024-03-12 00:42:06,611 INFO  L140   encePairwiseOnDemand]: 175/198 looper letters, 52 selfloop transitions, 29 changer transitions 0/252 dead transitions.
[2024-03-12 00:42:06,611 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 252 transitions, 748 flow
[2024-03-12 00:42:06,612 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:42:06,612 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:42:06,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1056 transitions.
[2024-03-12 00:42:06,614 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8888888888888888
[2024-03-12 00:42:06,614 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1056 transitions.
[2024-03-12 00:42:06,614 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1056 transitions.
[2024-03-12 00:42:06,614 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:06,614 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1056 transitions.
[2024-03-12 00:42:06,617 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 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-03-12 00:42:06,619 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 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-03-12 00:42:06,620 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 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-03-12 00:42:06,620 INFO  L175             Difference]: Start difference. First operand has 198 places, 203 transitions, 485 flow. Second operand 6 states and 1056 transitions.
[2024-03-12 00:42:06,620 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 252 transitions, 748 flow
[2024-03-12 00:42:06,625 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 252 transitions, 746 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:42:06,636 INFO  L231             Difference]: Finished difference. Result has 207 places, 232 transitions, 703 flow
[2024-03-12 00:42:06,637 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=703, PETRI_PLACES=207, PETRI_TRANSITIONS=232}
[2024-03-12 00:42:06,638 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 17 predicate places.
[2024-03-12 00:42:06,638 INFO  L495      AbstractCegarLoop]: Abstraction has has 207 places, 232 transitions, 703 flow
[2024-03-12 00:42:06,639 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 163.16666666666666) internal successors, (979), 6 states have internal predecessors, (979), 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-03-12 00:42:06,639 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:06,639 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-03-12 00:42:06,639 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-12 00:42:06,640 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:06,641 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:06,642 INFO  L85        PathProgramCache]: Analyzing trace with hash 1962435246, now seen corresponding path program 1 times
[2024-03-12 00:42:06,642 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:06,643 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245899437]
[2024-03-12 00:42:06,643 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:06,644 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:06,667 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:06,690 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:06,690 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:06,690 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245899437]
[2024-03-12 00:42:06,690 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245899437] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:06,690 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:06,690 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:42:06,691 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844560064]
[2024-03-12 00:42:06,691 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:06,691 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:42:06,691 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:06,692 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:42:06,692 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:42:06,703 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 181 out of 198
[2024-03-12 00:42:06,705 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 232 transitions, 703 flow. Second operand  has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 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-03-12 00:42:06,705 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:06,705 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 198
[2024-03-12 00:42:06,705 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:06,849 INFO  L124   PetriNetUnfolderBase]: 205/1519 cut-off events.
[2024-03-12 00:42:06,850 INFO  L125   PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES.
[2024-03-12 00:42:06,853 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2201 conditions, 1519 events. 205/1519 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10793 event pairs, 21 based on Foata normal form. 0/1358 useless extension candidates. Maximal degree in co-relation 1935. Up to 114 conditions per place. 
[2024-03-12 00:42:06,856 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 13 selfloop transitions, 2 changer transitions 4/234 dead transitions.
[2024-03-12 00:42:06,860 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 234 transitions, 737 flow
[2024-03-12 00:42:06,860 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:42:06,860 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:42:06,861 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions.
[2024-03-12 00:42:06,861 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9427609427609428
[2024-03-12 00:42:06,861 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 560 transitions.
[2024-03-12 00:42:06,862 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 560 transitions.
[2024-03-12 00:42:06,862 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:06,862 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 560 transitions.
[2024-03-12 00:42:06,864 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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-03-12 00:42:06,865 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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-03-12 00:42:06,865 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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-03-12 00:42:06,865 INFO  L175             Difference]: Start difference. First operand has 207 places, 232 transitions, 703 flow. Second operand 3 states and 560 transitions.
[2024-03-12 00:42:06,865 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 234 transitions, 737 flow
[2024-03-12 00:42:06,869 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 234 transitions, 737 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:42:06,871 INFO  L231             Difference]: Finished difference. Result has 208 places, 228 transitions, 689 flow
[2024-03-12 00:42:06,872 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=208, PETRI_TRANSITIONS=228}
[2024-03-12 00:42:06,874 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 18 predicate places.
[2024-03-12 00:42:06,874 INFO  L495      AbstractCegarLoop]: Abstraction has has 208 places, 228 transitions, 689 flow
[2024-03-12 00:42:06,875 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 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-03-12 00:42:06,875 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:06,875 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, 1, 1, 1, 1]
[2024-03-12 00:42:06,875 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-12 00:42:06,875 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:06,876 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:06,876 INFO  L85        PathProgramCache]: Analyzing trace with hash -1906226017, now seen corresponding path program 1 times
[2024-03-12 00:42:06,877 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:06,877 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463801531]
[2024-03-12 00:42:06,877 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:06,877 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:06,896 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:06,958 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:06,959 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:06,959 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463801531]
[2024-03-12 00:42:06,959 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463801531] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:06,959 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:06,960 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:42:06,960 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921224411]
[2024-03-12 00:42:06,960 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:06,961 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:42:06,962 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:06,962 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:42:06,962 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:42:06,996 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-03-12 00:42:06,997 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 228 transitions, 689 flow. Second operand  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 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-03-12 00:42:06,997 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:06,997 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-03-12 00:42:06,997 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:07,153 INFO  L124   PetriNetUnfolderBase]: 200/1438 cut-off events.
[2024-03-12 00:42:07,154 INFO  L125   PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES.
[2024-03-12 00:42:07,156 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2179 conditions, 1438 events. 200/1438 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10134 event pairs, 36 based on Foata normal form. 1/1297 useless extension candidates. Maximal degree in co-relation 2018. Up to 138 conditions per place. 
[2024-03-12 00:42:07,160 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 17 selfloop transitions, 4 changer transitions 0/234 dead transitions.
[2024-03-12 00:42:07,160 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 234 transitions, 743 flow
[2024-03-12 00:42:07,160 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:42:07,161 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:42:07,162 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 738 transitions.
[2024-03-12 00:42:07,162 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9318181818181818
[2024-03-12 00:42:07,162 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 738 transitions.
[2024-03-12 00:42:07,162 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 738 transitions.
[2024-03-12 00:42:07,163 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:07,163 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 738 transitions.
[2024-03-12 00:42:07,164 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 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-03-12 00:42:07,166 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 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-03-12 00:42:07,166 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 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-03-12 00:42:07,166 INFO  L175             Difference]: Start difference. First operand has 208 places, 228 transitions, 689 flow. Second operand 4 states and 738 transitions.
[2024-03-12 00:42:07,166 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 234 transitions, 743 flow
[2024-03-12 00:42:07,169 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 234 transitions, 731 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-12 00:42:07,172 INFO  L231             Difference]: Finished difference. Result has 206 places, 231 transitions, 702 flow
[2024-03-12 00:42:07,172 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=702, PETRI_PLACES=206, PETRI_TRANSITIONS=231}
[2024-03-12 00:42:07,174 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 16 predicate places.
[2024-03-12 00:42:07,174 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 231 transitions, 702 flow
[2024-03-12 00:42:07,175 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 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-03-12 00:42:07,175 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:07,175 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, 1, 1, 1, 1]
[2024-03-12 00:42:07,175 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-12 00:42:07,175 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:07,175 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:07,175 INFO  L85        PathProgramCache]: Analyzing trace with hash -448517900, now seen corresponding path program 1 times
[2024-03-12 00:42:07,175 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:07,176 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626237920]
[2024-03-12 00:42:07,176 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:07,176 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:07,186 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:07,248 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:07,249 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:07,249 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626237920]
[2024-03-12 00:42:07,249 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626237920] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:07,249 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:07,250 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:42:07,250 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523252049]
[2024-03-12 00:42:07,250 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:07,250 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:42:07,251 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:07,251 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:42:07,251 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:42:07,303 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-03-12 00:42:07,304 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 231 transitions, 702 flow. Second operand  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 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-03-12 00:42:07,304 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:07,304 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-03-12 00:42:07,304 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:07,443 INFO  L124   PetriNetUnfolderBase]: 199/1436 cut-off events.
[2024-03-12 00:42:07,444 INFO  L125   PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES.
[2024-03-12 00:42:07,447 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 1436 events. 199/1436 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10120 event pairs, 36 based on Foata normal form. 1/1292 useless extension candidates. Maximal degree in co-relation 2018. Up to 138 conditions per place. 
[2024-03-12 00:42:07,450 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 16 selfloop transitions, 4 changer transitions 0/233 dead transitions.
[2024-03-12 00:42:07,450 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 233 transitions, 746 flow
[2024-03-12 00:42:07,451 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:42:07,451 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:42:07,452 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 737 transitions.
[2024-03-12 00:42:07,452 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9305555555555556
[2024-03-12 00:42:07,452 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 737 transitions.
[2024-03-12 00:42:07,452 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 737 transitions.
[2024-03-12 00:42:07,453 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:07,453 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 737 transitions.
[2024-03-12 00:42:07,454 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 184.25) internal successors, (737), 4 states have internal predecessors, (737), 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-03-12 00:42:07,455 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 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-03-12 00:42:07,456 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 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-03-12 00:42:07,456 INFO  L175             Difference]: Start difference. First operand has 206 places, 231 transitions, 702 flow. Second operand 4 states and 737 transitions.
[2024-03-12 00:42:07,456 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 233 transitions, 746 flow
[2024-03-12 00:42:07,459 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 233 transitions, 746 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:42:07,461 INFO  L231             Difference]: Finished difference. Result has 211 places, 232 transitions, 721 flow
[2024-03-12 00:42:07,461 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=721, PETRI_PLACES=211, PETRI_TRANSITIONS=232}
[2024-03-12 00:42:07,462 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 21 predicate places.
[2024-03-12 00:42:07,462 INFO  L495      AbstractCegarLoop]: Abstraction has has 211 places, 232 transitions, 721 flow
[2024-03-12 00:42:07,463 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 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-03-12 00:42:07,463 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:07,463 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, 1, 1, 1, 1, 1]
[2024-03-12 00:42:07,463 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-12 00:42:07,463 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:07,464 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:07,464 INFO  L85        PathProgramCache]: Analyzing trace with hash 1105825585, now seen corresponding path program 1 times
[2024-03-12 00:42:07,464 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:07,464 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922406247]
[2024-03-12 00:42:07,464 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:07,465 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:07,473 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:07,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:07,520 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:07,520 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922406247]
[2024-03-12 00:42:07,521 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922406247] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:07,521 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:07,521 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:42:07,521 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686626202]
[2024-03-12 00:42:07,521 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:07,521 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:42:07,522 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:07,522 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:42:07,522 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:42:07,569 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-03-12 00:42:07,570 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 232 transitions, 721 flow. Second operand  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 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-03-12 00:42:07,570 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:07,570 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-03-12 00:42:07,570 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:07,697 INFO  L124   PetriNetUnfolderBase]: 198/1434 cut-off events.
[2024-03-12 00:42:07,698 INFO  L125   PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES.
[2024-03-12 00:42:07,701 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2202 conditions, 1434 events. 198/1434 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10151 event pairs, 36 based on Foata normal form. 1/1298 useless extension candidates. Maximal degree in co-relation 2085. Up to 138 conditions per place. 
[2024-03-12 00:42:07,704 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 17 selfloop transitions, 4 changer transitions 0/234 dead transitions.
[2024-03-12 00:42:07,705 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 234 transitions, 767 flow
[2024-03-12 00:42:07,705 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:42:07,705 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:42:07,706 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 738 transitions.
[2024-03-12 00:42:07,707 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9318181818181818
[2024-03-12 00:42:07,707 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 738 transitions.
[2024-03-12 00:42:07,707 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 738 transitions.
[2024-03-12 00:42:07,707 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:07,708 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 738 transitions.
[2024-03-12 00:42:07,709 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 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-03-12 00:42:07,710 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 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-03-12 00:42:07,710 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 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-03-12 00:42:07,710 INFO  L175             Difference]: Start difference. First operand has 211 places, 232 transitions, 721 flow. Second operand 4 states and 738 transitions.
[2024-03-12 00:42:07,710 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 234 transitions, 767 flow
[2024-03-12 00:42:07,714 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 234 transitions, 764 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:42:07,716 INFO  L231             Difference]: Finished difference. Result has 214 places, 232 transitions, 730 flow
[2024-03-12 00:42:07,716 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=730, PETRI_PLACES=214, PETRI_TRANSITIONS=232}
[2024-03-12 00:42:07,716 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 24 predicate places.
[2024-03-12 00:42:07,717 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 232 transitions, 730 flow
[2024-03-12 00:42:07,717 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 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-03-12 00:42:07,717 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:07,717 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, 1, 1, 1, 1, 1]
[2024-03-12 00:42:07,717 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-12 00:42:07,718 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:07,718 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:07,718 INFO  L85        PathProgramCache]: Analyzing trace with hash -949863044, now seen corresponding path program 1 times
[2024-03-12 00:42:07,718 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:07,718 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360113157]
[2024-03-12 00:42:07,718 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:07,719 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:07,727 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:07,764 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:07,764 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:07,765 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360113157]
[2024-03-12 00:42:07,765 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360113157] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:07,765 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:07,765 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:42:07,765 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292786305]
[2024-03-12 00:42:07,765 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:07,766 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:42:07,766 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:07,766 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:42:07,766 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:42:07,813 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 178 out of 198
[2024-03-12 00:42:07,814 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 232 transitions, 730 flow. Second operand  has 4 states, 4 states have (on average 179.5) internal successors, (718), 4 states have internal predecessors, (718), 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-03-12 00:42:07,814 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:07,814 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 198
[2024-03-12 00:42:07,814 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:07,957 INFO  L124   PetriNetUnfolderBase]: 201/1436 cut-off events.
[2024-03-12 00:42:07,957 INFO  L125   PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES.
[2024-03-12 00:42:07,961 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2223 conditions, 1436 events. 201/1436 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 10158 event pairs, 40 based on Foata normal form. 1/1298 useless extension candidates. Maximal degree in co-relation 2105. Up to 148 conditions per place. 
[2024-03-12 00:42:07,965 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 17 selfloop transitions, 4 changer transitions 0/233 dead transitions.
[2024-03-12 00:42:07,965 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 233 transitions, 774 flow
[2024-03-12 00:42:07,965 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:42:07,965 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:42:07,967 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 734 transitions.
[2024-03-12 00:42:07,967 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9267676767676768
[2024-03-12 00:42:07,967 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 734 transitions.
[2024-03-12 00:42:07,967 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 734 transitions.
[2024-03-12 00:42:07,968 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:07,968 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 734 transitions.
[2024-03-12 00:42:07,969 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 183.5) internal successors, (734), 4 states have internal predecessors, (734), 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-03-12 00:42:07,970 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 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-03-12 00:42:07,970 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 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-03-12 00:42:07,971 INFO  L175             Difference]: Start difference. First operand has 214 places, 232 transitions, 730 flow. Second operand 4 states and 734 transitions.
[2024-03-12 00:42:07,971 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 233 transitions, 774 flow
[2024-03-12 00:42:07,974 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 233 transitions, 766 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 00:42:07,976 INFO  L231             Difference]: Finished difference. Result has 215 places, 232 transitions, 734 flow
[2024-03-12 00:42:07,976 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=734, PETRI_PLACES=215, PETRI_TRANSITIONS=232}
[2024-03-12 00:42:07,977 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 25 predicate places.
[2024-03-12 00:42:07,977 INFO  L495      AbstractCegarLoop]: Abstraction has has 215 places, 232 transitions, 734 flow
[2024-03-12 00:42:07,977 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 179.5) internal successors, (718), 4 states have internal predecessors, (718), 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-03-12 00:42:07,978 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:07,978 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:42:07,978 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-12 00:42:07,978 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:07,978 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:07,978 INFO  L85        PathProgramCache]: Analyzing trace with hash 1442556267, now seen corresponding path program 1 times
[2024-03-12 00:42:07,979 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:07,979 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566148753]
[2024-03-12 00:42:07,979 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:07,979 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:07,988 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:08,005 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:08,005 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:08,005 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566148753]
[2024-03-12 00:42:08,005 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566148753] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:08,006 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:08,006 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:42:08,006 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223386100]
[2024-03-12 00:42:08,006 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:08,006 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:42:08,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:08,007 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:42:08,007 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:42:08,032 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 198
[2024-03-12 00:42:08,033 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 232 transitions, 734 flow. Second operand  has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 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-03-12 00:42:08,033 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:08,033 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 198
[2024-03-12 00:42:08,033 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:08,164 INFO  L124   PetriNetUnfolderBase]: 223/1511 cut-off events.
[2024-03-12 00:42:08,164 INFO  L125   PetriNetUnfolderBase]: For 187/196 co-relation queries the response was YES.
[2024-03-12 00:42:08,168 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2343 conditions, 1511 events. 223/1511 cut-off events. For 187/196 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10898 event pairs, 35 based on Foata normal form. 1/1363 useless extension candidates. Maximal degree in co-relation 2291. Up to 177 conditions per place. 
[2024-03-12 00:42:08,172 INFO  L140   encePairwiseOnDemand]: 192/198 looper letters, 22 selfloop transitions, 7 changer transitions 0/239 dead transitions.
[2024-03-12 00:42:08,172 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 239 transitions, 812 flow
[2024-03-12 00:42:08,173 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:42:08,173 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:42:08,174 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions.
[2024-03-12 00:42:08,174 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9343434343434344
[2024-03-12 00:42:08,174 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 555 transitions.
[2024-03-12 00:42:08,174 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 555 transitions.
[2024-03-12 00:42:08,175 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:08,175 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 555 transitions.
[2024-03-12 00:42:08,176 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 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-03-12 00:42:08,177 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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-03-12 00:42:08,177 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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-03-12 00:42:08,177 INFO  L175             Difference]: Start difference. First operand has 215 places, 232 transitions, 734 flow. Second operand 3 states and 555 transitions.
[2024-03-12 00:42:08,177 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 239 transitions, 812 flow
[2024-03-12 00:42:08,181 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 239 transitions, 804 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 00:42:08,183 INFO  L231             Difference]: Finished difference. Result has 216 places, 237 transitions, 782 flow
[2024-03-12 00:42:08,183 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=216, PETRI_TRANSITIONS=237}
[2024-03-12 00:42:08,184 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 26 predicate places.
[2024-03-12 00:42:08,184 INFO  L495      AbstractCegarLoop]: Abstraction has has 216 places, 237 transitions, 782 flow
[2024-03-12 00:42:08,184 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 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-03-12 00:42:08,184 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:08,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:42:08,185 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-12 00:42:08,185 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:08,185 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:08,185 INFO  L85        PathProgramCache]: Analyzing trace with hash -481296020, now seen corresponding path program 1 times
[2024-03-12 00:42:08,185 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:08,185 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953503857]
[2024-03-12 00:42:08,186 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:08,186 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:08,204 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:08,474 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:08,475 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:08,475 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953503857]
[2024-03-12 00:42:08,475 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953503857] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:08,475 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:08,475 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:42:08,475 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580999809]
[2024-03-12 00:42:08,476 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:08,476 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:42:08,476 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:08,476 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:42:08,476 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:42:08,594 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 161 out of 198
[2024-03-12 00:42:08,595 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 237 transitions, 782 flow. Second operand  has 6 states, 6 states have (on average 163.66666666666666) internal successors, (982), 6 states have internal predecessors, (982), 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-03-12 00:42:08,595 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:08,595 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 198
[2024-03-12 00:42:08,595 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:08,997 INFO  L124   PetriNetUnfolderBase]: 567/2728 cut-off events.
[2024-03-12 00:42:08,997 INFO  L125   PetriNetUnfolderBase]: For 664/719 co-relation queries the response was YES.
[2024-03-12 00:42:09,003 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4921 conditions, 2728 events. 567/2728 cut-off events. For 664/719 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 22357 event pairs, 129 based on Foata normal form. 9/2479 useless extension candidates. Maximal degree in co-relation 4874. Up to 768 conditions per place. 
[2024-03-12 00:42:09,010 INFO  L140   encePairwiseOnDemand]: 175/198 looper letters, 64 selfloop transitions, 83 changer transitions 0/326 dead transitions.
[2024-03-12 00:42:09,010 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 326 transitions, 1428 flow
[2024-03-12 00:42:09,011 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:42:09,011 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:42:09,012 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1077 transitions.
[2024-03-12 00:42:09,013 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9065656565656566
[2024-03-12 00:42:09,013 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1077 transitions.
[2024-03-12 00:42:09,013 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1077 transitions.
[2024-03-12 00:42:09,014 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:09,014 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1077 transitions.
[2024-03-12 00:42:09,016 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 179.5) internal successors, (1077), 6 states have internal predecessors, (1077), 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-03-12 00:42:09,018 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 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-03-12 00:42:09,018 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 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-03-12 00:42:09,018 INFO  L175             Difference]: Start difference. First operand has 216 places, 237 transitions, 782 flow. Second operand 6 states and 1077 transitions.
[2024-03-12 00:42:09,018 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 326 transitions, 1428 flow
[2024-03-12 00:42:09,023 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 326 transitions, 1414 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:42:09,029 INFO  L231             Difference]: Finished difference. Result has 224 places, 318 transitions, 1504 flow
[2024-03-12 00:42:09,029 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1504, PETRI_PLACES=224, PETRI_TRANSITIONS=318}
[2024-03-12 00:42:09,029 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 34 predicate places.
[2024-03-12 00:42:09,030 INFO  L495      AbstractCegarLoop]: Abstraction has has 224 places, 318 transitions, 1504 flow
[2024-03-12 00:42:09,030 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 163.66666666666666) internal successors, (982), 6 states have internal predecessors, (982), 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-03-12 00:42:09,030 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:09,030 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:42:09,030 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-12 00:42:09,030 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:09,030 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:09,031 INFO  L85        PathProgramCache]: Analyzing trace with hash 7104340, now seen corresponding path program 1 times
[2024-03-12 00:42:09,031 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:09,031 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165864112]
[2024-03-12 00:42:09,031 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:09,031 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:09,060 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:09,345 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:42:09,345 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:09,345 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165864112]
[2024-03-12 00:42:09,346 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165864112] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:09,346 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:09,346 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:42:09,346 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481425001]
[2024-03-12 00:42:09,346 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:09,346 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:42:09,347 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:09,347 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:42:09,347 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:42:09,594 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 171 out of 198
[2024-03-12 00:42:09,595 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 318 transitions, 1504 flow. Second operand  has 6 states, 6 states have (on average 172.83333333333334) internal successors, (1037), 6 states have internal predecessors, (1037), 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-03-12 00:42:09,596 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:09,596 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 198
[2024-03-12 00:42:09,596 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:09,899 INFO  L124   PetriNetUnfolderBase]: 520/2369 cut-off events.
[2024-03-12 00:42:09,900 INFO  L125   PetriNetUnfolderBase]: For 1360/1387 co-relation queries the response was YES.
[2024-03-12 00:42:09,906 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5136 conditions, 2369 events. 520/2369 cut-off events. For 1360/1387 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 18327 event pairs, 65 based on Foata normal form. 0/2205 useless extension candidates. Maximal degree in co-relation 5081. Up to 434 conditions per place. 
[2024-03-12 00:42:09,912 INFO  L140   encePairwiseOnDemand]: 187/198 looper letters, 54 selfloop transitions, 43 changer transitions 12/366 dead transitions.
[2024-03-12 00:42:09,912 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 366 transitions, 2003 flow
[2024-03-12 00:42:09,913 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:42:09,913 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:42:09,914 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1080 transitions.
[2024-03-12 00:42:09,915 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9090909090909091
[2024-03-12 00:42:09,915 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1080 transitions.
[2024-03-12 00:42:09,915 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1080 transitions.
[2024-03-12 00:42:09,916 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:09,916 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1080 transitions.
[2024-03-12 00:42:09,918 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 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-03-12 00:42:09,919 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 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-03-12 00:42:09,920 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 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-03-12 00:42:09,920 INFO  L175             Difference]: Start difference. First operand has 224 places, 318 transitions, 1504 flow. Second operand 6 states and 1080 transitions.
[2024-03-12 00:42:09,920 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 366 transitions, 2003 flow
[2024-03-12 00:42:09,930 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 366 transitions, 1949 flow, removed 27 selfloop flow, removed 0 redundant places.
[2024-03-12 00:42:09,933 INFO  L231             Difference]: Finished difference. Result has 234 places, 350 transitions, 1907 flow
[2024-03-12 00:42:09,934 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1907, PETRI_PLACES=234, PETRI_TRANSITIONS=350}
[2024-03-12 00:42:09,934 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 44 predicate places.
[2024-03-12 00:42:09,934 INFO  L495      AbstractCegarLoop]: Abstraction has has 234 places, 350 transitions, 1907 flow
[2024-03-12 00:42:09,935 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 172.83333333333334) internal successors, (1037), 6 states have internal predecessors, (1037), 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-03-12 00:42:09,935 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:09,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:42:09,935 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-12 00:42:09,935 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:09,936 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:09,936 INFO  L85        PathProgramCache]: Analyzing trace with hash -1630577086, now seen corresponding path program 1 times
[2024-03-12 00:42:09,936 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:09,936 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475492414]
[2024-03-12 00:42:09,936 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:09,936 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:09,962 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:10,321 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:10,321 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:10,322 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475492414]
[2024-03-12 00:42:10,322 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475492414] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:10,322 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:10,322 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-03-12 00:42:10,322 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820440534]
[2024-03-12 00:42:10,322 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:10,323 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-12 00:42:10,323 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:10,323 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-12 00:42:10,324 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-12 00:42:10,707 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 155 out of 198
[2024-03-12 00:42:10,708 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 350 transitions, 1907 flow. Second operand  has 10 states, 10 states have (on average 157.1) internal successors, (1571), 10 states have internal predecessors, (1571), 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-03-12 00:42:10,708 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:10,708 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 198
[2024-03-12 00:42:10,708 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:11,553 INFO  L124   PetriNetUnfolderBase]: 624/2784 cut-off events.
[2024-03-12 00:42:11,554 INFO  L125   PetriNetUnfolderBase]: For 2186/2398 co-relation queries the response was YES.
[2024-03-12 00:42:11,560 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6637 conditions, 2784 events. 624/2784 cut-off events. For 2186/2398 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 23258 event pairs, 114 based on Foata normal form. 82/2653 useless extension candidates. Maximal degree in co-relation 6581. Up to 527 conditions per place. 
[2024-03-12 00:42:11,566 INFO  L140   encePairwiseOnDemand]: 182/198 looper letters, 220 selfloop transitions, 73 changer transitions 1/462 dead transitions.
[2024-03-12 00:42:11,566 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 462 transitions, 3201 flow
[2024-03-12 00:42:11,567 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-12 00:42:11,567 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-12 00:42:11,569 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1839 transitions.
[2024-03-12 00:42:11,570 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8443526170798898
[2024-03-12 00:42:11,570 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1839 transitions.
[2024-03-12 00:42:11,570 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1839 transitions.
[2024-03-12 00:42:11,571 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:11,571 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1839 transitions.
[2024-03-12 00:42:11,574 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 167.1818181818182) internal successors, (1839), 11 states have internal predecessors, (1839), 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-03-12 00:42:11,576 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 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-03-12 00:42:11,577 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 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-03-12 00:42:11,577 INFO  L175             Difference]: Start difference. First operand has 234 places, 350 transitions, 1907 flow. Second operand 11 states and 1839 transitions.
[2024-03-12 00:42:11,577 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 462 transitions, 3201 flow
[2024-03-12 00:42:11,589 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 462 transitions, 3165 flow, removed 18 selfloop flow, removed 0 redundant places.
[2024-03-12 00:42:11,594 INFO  L231             Difference]: Finished difference. Result has 246 places, 374 transitions, 2339 flow
[2024-03-12 00:42:11,594 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2339, PETRI_PLACES=246, PETRI_TRANSITIONS=374}
[2024-03-12 00:42:11,594 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 56 predicate places.
[2024-03-12 00:42:11,595 INFO  L495      AbstractCegarLoop]: Abstraction has has 246 places, 374 transitions, 2339 flow
[2024-03-12 00:42:11,595 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 157.1) internal successors, (1571), 10 states have internal predecessors, (1571), 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-03-12 00:42:11,595 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:11,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:42:11,596 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-12 00:42:11,596 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:11,596 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:11,596 INFO  L85        PathProgramCache]: Analyzing trace with hash -843954482, now seen corresponding path program 1 times
[2024-03-12 00:42:11,596 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:11,597 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586196163]
[2024-03-12 00:42:11,597 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:11,597 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:11,616 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:11,958 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:42:11,958 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:11,958 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586196163]
[2024-03-12 00:42:11,959 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586196163] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:11,959 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:11,959 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-03-12 00:42:11,959 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189753210]
[2024-03-12 00:42:11,959 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:11,959 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-12 00:42:11,960 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:11,960 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-12 00:42:11,960 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-12 00:42:12,388 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 158 out of 198
[2024-03-12 00:42:12,389 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 374 transitions, 2339 flow. Second operand  has 10 states, 10 states have (on average 160.0) internal successors, (1600), 10 states have internal predecessors, (1600), 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-03-12 00:42:12,389 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:12,389 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 198
[2024-03-12 00:42:12,389 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:12,890 INFO  L124   PetriNetUnfolderBase]: 533/2461 cut-off events.
[2024-03-12 00:42:12,890 INFO  L125   PetriNetUnfolderBase]: For 3895/4124 co-relation queries the response was YES.
[2024-03-12 00:42:12,897 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6579 conditions, 2461 events. 533/2461 cut-off events. For 3895/4124 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 20447 event pairs, 84 based on Foata normal form. 47/2334 useless extension candidates. Maximal degree in co-relation 6512. Up to 633 conditions per place. 
[2024-03-12 00:42:12,901 INFO  L140   encePairwiseOnDemand]: 186/198 looper letters, 161 selfloop transitions, 18 changer transitions 1/382 dead transitions.
[2024-03-12 00:42:12,902 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 382 transitions, 2757 flow
[2024-03-12 00:42:12,902 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 00:42:12,902 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 00:42:12,904 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1627 transitions.
[2024-03-12 00:42:12,905 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8217171717171717
[2024-03-12 00:42:12,905 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1627 transitions.
[2024-03-12 00:42:12,905 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1627 transitions.
[2024-03-12 00:42:12,905 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:12,906 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1627 transitions.
[2024-03-12 00:42:12,908 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 162.7) internal successors, (1627), 10 states have internal predecessors, (1627), 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-03-12 00:42:12,910 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 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-03-12 00:42:12,911 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 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-03-12 00:42:12,911 INFO  L175             Difference]: Start difference. First operand has 246 places, 374 transitions, 2339 flow. Second operand 10 states and 1627 transitions.
[2024-03-12 00:42:12,911 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 382 transitions, 2757 flow
[2024-03-12 00:42:12,929 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 382 transitions, 2751 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 00:42:12,933 INFO  L231             Difference]: Finished difference. Result has 253 places, 375 transitions, 2405 flow
[2024-03-12 00:42:12,934 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=2321, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2405, PETRI_PLACES=253, PETRI_TRANSITIONS=375}
[2024-03-12 00:42:12,934 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 63 predicate places.
[2024-03-12 00:42:12,934 INFO  L495      AbstractCegarLoop]: Abstraction has has 253 places, 375 transitions, 2405 flow
[2024-03-12 00:42:12,935 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 160.0) internal successors, (1600), 10 states have internal predecessors, (1600), 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-03-12 00:42:12,935 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:12,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:42:12,935 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-12 00:42:12,936 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:12,936 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:12,936 INFO  L85        PathProgramCache]: Analyzing trace with hash 2091322874, now seen corresponding path program 1 times
[2024-03-12 00:42:12,936 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:12,936 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612119694]
[2024-03-12 00:42:12,936 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:12,936 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:12,951 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:12,970 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:12,970 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:12,970 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612119694]
[2024-03-12 00:42:12,970 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612119694] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:12,970 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:12,970 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:42:12,971 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4147537]
[2024-03-12 00:42:12,971 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:12,971 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:42:12,971 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:12,971 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:42:12,971 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:42:12,989 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-03-12 00:42:12,990 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 375 transitions, 2405 flow. Second operand  has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 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-03-12 00:42:12,990 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:12,990 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-03-12 00:42:12,990 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:13,313 INFO  L124   PetriNetUnfolderBase]: 492/2306 cut-off events.
[2024-03-12 00:42:13,314 INFO  L125   PetriNetUnfolderBase]: For 3298/3383 co-relation queries the response was YES.
[2024-03-12 00:42:13,322 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5942 conditions, 2306 events. 492/2306 cut-off events. For 3298/3383 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 18510 event pairs, 47 based on Foata normal form. 12/2193 useless extension candidates. Maximal degree in co-relation 5862. Up to 278 conditions per place. 
[2024-03-12 00:42:13,326 INFO  L140   encePairwiseOnDemand]: 191/198 looper letters, 20 selfloop transitions, 11 changer transitions 31/384 dead transitions.
[2024-03-12 00:42:13,327 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 384 transitions, 2499 flow
[2024-03-12 00:42:13,327 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:42:13,327 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:42:13,328 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions.
[2024-03-12 00:42:13,328 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9410774410774411
[2024-03-12 00:42:13,328 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 559 transitions.
[2024-03-12 00:42:13,328 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 559 transitions.
[2024-03-12 00:42:13,329 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:13,329 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 559 transitions.
[2024-03-12 00:42:13,330 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 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-03-12 00:42:13,330 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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-03-12 00:42:13,331 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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-03-12 00:42:13,331 INFO  L175             Difference]: Start difference. First operand has 253 places, 375 transitions, 2405 flow. Second operand 3 states and 559 transitions.
[2024-03-12 00:42:13,331 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 384 transitions, 2499 flow
[2024-03-12 00:42:13,354 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 384 transitions, 2463 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-03-12 00:42:13,358 INFO  L231             Difference]: Finished difference. Result has 252 places, 351 transitions, 2140 flow
[2024-03-12 00:42:13,359 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=2369, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2140, PETRI_PLACES=252, PETRI_TRANSITIONS=351}
[2024-03-12 00:42:13,359 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 62 predicate places.
[2024-03-12 00:42:13,359 INFO  L495      AbstractCegarLoop]: Abstraction has has 252 places, 351 transitions, 2140 flow
[2024-03-12 00:42:13,359 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 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-03-12 00:42:13,359 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:13,360 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:42:13,360 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-12 00:42:13,360 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:13,360 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:13,360 INFO  L85        PathProgramCache]: Analyzing trace with hash -1074967984, now seen corresponding path program 1 times
[2024-03-12 00:42:13,360 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:13,360 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321942411]
[2024-03-12 00:42:13,361 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:13,361 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:13,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:13,903 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:13,903 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:13,903 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321942411]
[2024-03-12 00:42:13,903 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321942411] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:42:13,903 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509640605]
[2024-03-12 00:42:13,904 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:13,904 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:42:13,904 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:42:13,906 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-03-12 00:42:13,914 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-03-12 00:42:14,057 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:14,060 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-03-12 00:42:14,075 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:42:14,118 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-03-12 00:42:14,167 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-12 00:42:14,168 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2024-03-12 00:42:14,252 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-03-12 00:42:14,253 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-03-12 00:42:14,631 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:42:14,631 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32
[2024-03-12 00:42:14,708 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 24 treesize of output 12
[2024-03-12 00:42:14,733 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 15 treesize of output 11
[2024-03-12 00:42:14,742 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 28 treesize of output 27
[2024-03-12 00:42:14,759 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:42:14,759 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 40 treesize of output 42
[2024-03-12 00:42:14,781 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:42:14,781 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 52 treesize of output 57
[2024-03-12 00:42:14,820 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 56 treesize of output 45
[2024-03-12 00:42:14,834 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:42:14,834 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:42:14,834 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509640605] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:14,834 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:42:14,834 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 19
[2024-03-12 00:42:14,835 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387811930]
[2024-03-12 00:42:14,835 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:14,835 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-03-12 00:42:14,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:14,836 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-03-12 00:42:14,836 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380
[2024-03-12 00:42:15,372 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 143 out of 198
[2024-03-12 00:42:15,373 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 351 transitions, 2140 flow. Second operand  has 14 states, 14 states have (on average 145.35714285714286) internal successors, (2035), 14 states have internal predecessors, (2035), 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-03-12 00:42:15,374 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:15,374 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 198
[2024-03-12 00:42:15,374 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:16,535 INFO  L124   PetriNetUnfolderBase]: 821/3232 cut-off events.
[2024-03-12 00:42:16,535 INFO  L125   PetriNetUnfolderBase]: For 5924/6023 co-relation queries the response was YES.
[2024-03-12 00:42:16,548 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9474 conditions, 3232 events. 821/3232 cut-off events. For 5924/6023 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 26943 event pairs, 127 based on Foata normal form. 16/3067 useless extension candidates. Maximal degree in co-relation 9389. Up to 406 conditions per place. 
[2024-03-12 00:42:16,554 INFO  L140   encePairwiseOnDemand]: 179/198 looper letters, 272 selfloop transitions, 81 changer transitions 38/550 dead transitions.
[2024-03-12 00:42:16,555 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 550 transitions, 4722 flow
[2024-03-12 00:42:16,556 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-12 00:42:16,556 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-12 00:42:16,559 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2853 transitions.
[2024-03-12 00:42:16,560 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7583732057416268
[2024-03-12 00:42:16,560 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 2853 transitions.
[2024-03-12 00:42:16,560 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 2853 transitions.
[2024-03-12 00:42:16,561 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:16,561 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2853 transitions.
[2024-03-12 00:42:16,564 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 150.1578947368421) internal successors, (2853), 19 states have internal predecessors, (2853), 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-03-12 00:42:16,568 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 198.0) internal successors, (3960), 20 states have internal predecessors, (3960), 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-03-12 00:42:16,569 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 198.0) internal successors, (3960), 20 states have internal predecessors, (3960), 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-03-12 00:42:16,570 INFO  L175             Difference]: Start difference. First operand has 252 places, 351 transitions, 2140 flow. Second operand 19 states and 2853 transitions.
[2024-03-12 00:42:16,570 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 550 transitions, 4722 flow
[2024-03-12 00:42:16,599 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 550 transitions, 4689 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-03-12 00:42:16,604 INFO  L231             Difference]: Finished difference. Result has 269 places, 402 transitions, 3003 flow
[2024-03-12 00:42:16,604 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=2109, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3003, PETRI_PLACES=269, PETRI_TRANSITIONS=402}
[2024-03-12 00:42:16,605 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 79 predicate places.
[2024-03-12 00:42:16,605 INFO  L495      AbstractCegarLoop]: Abstraction has has 269 places, 402 transitions, 3003 flow
[2024-03-12 00:42:16,605 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 145.35714285714286) internal successors, (2035), 14 states have internal predecessors, (2035), 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-03-12 00:42:16,605 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:16,606 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:42:16,612 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-03-12 00:42:16,807 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:42:16,807 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:16,808 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:16,808 INFO  L85        PathProgramCache]: Analyzing trace with hash 439816372, now seen corresponding path program 2 times
[2024-03-12 00:42:16,808 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:16,808 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150028582]
[2024-03-12 00:42:16,809 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:16,809 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:16,840 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:17,625 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:17,625 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:17,625 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150028582]
[2024-03-12 00:42:17,626 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150028582] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:42:17,626 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817825442]
[2024-03-12 00:42:17,626 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-12 00:42:17,626 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:42:17,626 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:42:17,627 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-03-12 00:42:17,629 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-03-12 00:42:17,770 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-12 00:42:17,771 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:42:17,772 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 38 conjunts are in the unsatisfiable core
[2024-03-12 00:42:17,778 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:42:17,805 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-03-12 00:42:17,871 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:42:17,872 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 15 treesize of output 15
[2024-03-12 00:42:18,181 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:42:18,181 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-03-12 00:42:18,225 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:42:18,226 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 26 treesize of output 19
[2024-03-12 00:42:18,242 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 15 treesize of output 11
[2024-03-12 00:42:18,273 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 28 treesize of output 27
[2024-03-12 00:42:18,330 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:42:18,330 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 40 treesize of output 42
[2024-03-12 00:42:18,477 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13
[2024-03-12 00:42:18,530 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:42:18,531 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 44 treesize of output 35
[2024-03-12 00:42:18,559 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:42:18,559 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 52 treesize of output 57
[2024-03-12 00:42:18,613 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:42:18,613 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 56 treesize of output 45
[2024-03-12 00:42:18,629 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:42:18,630 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 56 treesize of output 45
[2024-03-12 00:42:18,659 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:42:18,660 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 56 treesize of output 45
[2024-03-12 00:42:18,691 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 56 treesize of output 45
[2024-03-12 00:42:18,698 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:18,698 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:42:18,698 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817825442] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:18,698 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:42:18,699 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-03-12 00:42:18,699 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861176147]
[2024-03-12 00:42:18,699 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:18,699 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-12 00:42:18,700 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:18,700 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-12 00:42:18,700 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702
[2024-03-12 00:42:19,647 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 198
[2024-03-12 00:42:19,649 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 402 transitions, 3003 flow. Second operand  has 15 states, 15 states have (on average 146.2) internal successors, (2193), 15 states have internal predecessors, (2193), 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-03-12 00:42:19,649 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:19,649 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 198
[2024-03-12 00:42:19,649 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:21,499 INFO  L124   PetriNetUnfolderBase]: 783/3111 cut-off events.
[2024-03-12 00:42:21,499 INFO  L125   PetriNetUnfolderBase]: For 9085/9196 co-relation queries the response was YES.
[2024-03-12 00:42:21,511 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10367 conditions, 3111 events. 783/3111 cut-off events. For 9085/9196 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 25364 event pairs, 92 based on Foata normal form. 38/3010 useless extension candidates. Maximal degree in co-relation 10264. Up to 580 conditions per place. 
[2024-03-12 00:42:21,518 INFO  L140   encePairwiseOnDemand]: 175/198 looper letters, 270 selfloop transitions, 137 changer transitions 21/588 dead transitions.
[2024-03-12 00:42:21,518 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 588 transitions, 5417 flow
[2024-03-12 00:42:21,519 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2024-03-12 00:42:21,519 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2024-03-12 00:42:21,523 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3794 transitions.
[2024-03-12 00:42:21,524 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7664646464646465
[2024-03-12 00:42:21,524 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 3794 transitions.
[2024-03-12 00:42:21,524 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 3794 transitions.
[2024-03-12 00:42:21,525 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:21,525 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3794 transitions.
[2024-03-12 00:42:21,530 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 151.76) internal successors, (3794), 25 states have internal predecessors, (3794), 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-03-12 00:42:21,564 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 198.0) internal successors, (5148), 26 states have internal predecessors, (5148), 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-03-12 00:42:21,565 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 198.0) internal successors, (5148), 26 states have internal predecessors, (5148), 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-03-12 00:42:21,565 INFO  L175             Difference]: Start difference. First operand has 269 places, 402 transitions, 3003 flow. Second operand 25 states and 3794 transitions.
[2024-03-12 00:42:21,565 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 588 transitions, 5417 flow
[2024-03-12 00:42:21,596 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 588 transitions, 5365 flow, removed 9 selfloop flow, removed 9 redundant places.
[2024-03-12 00:42:21,601 INFO  L231             Difference]: Finished difference. Result has 288 places, 456 transitions, 3986 flow
[2024-03-12 00:42:21,601 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=2959, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3986, PETRI_PLACES=288, PETRI_TRANSITIONS=456}
[2024-03-12 00:42:21,602 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 98 predicate places.
[2024-03-12 00:42:21,602 INFO  L495      AbstractCegarLoop]: Abstraction has has 288 places, 456 transitions, 3986 flow
[2024-03-12 00:42:21,602 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 146.2) internal successors, (2193), 15 states have internal predecessors, (2193), 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-03-12 00:42:21,602 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:21,603 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:42:21,610 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-03-12 00:42:21,803 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,SelfDestructingSolverStorable16
[2024-03-12 00:42:21,803 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:21,804 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:21,805 INFO  L85        PathProgramCache]: Analyzing trace with hash -588257106, now seen corresponding path program 3 times
[2024-03-12 00:42:21,805 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:21,805 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800433295]
[2024-03-12 00:42:21,805 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:21,805 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:21,837 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:22,510 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:22,511 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:22,511 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800433295]
[2024-03-12 00:42:22,511 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800433295] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:42:22,511 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926150632]
[2024-03-12 00:42:22,511 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-12 00:42:22,511 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:42:22,511 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:42:22,512 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-03-12 00:42:22,530 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-03-12 00:42:22,706 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-12 00:42:22,706 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:42:22,709 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 72 conjunts are in the unsatisfiable core
[2024-03-12 00:42:22,715 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:42:22,830 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-03-12 00:42:22,921 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:42:22,921 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 15 treesize of output 15
[2024-03-12 00:42:23,747 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:42:23,747 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45
[2024-03-12 00:42:23,754 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:42:23,756 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 24 treesize of output 11
[2024-03-12 00:42:24,025 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:42:24,026 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 26 treesize of output 19
[2024-03-12 00:42:24,040 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:42:24,041 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 16 treesize of output 11
[2024-03-12 00:42:24,124 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-03-12 00:42:24,535 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3
[2024-03-12 00:42:24,544 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13
[2024-03-12 00:42:24,593 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-03-12 00:42:24,672 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-03-12 00:42:24,758 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-03-12 00:42:24,846 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:42:24,847 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 37 treesize of output 26
[2024-03-12 00:42:24,874 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:42:24,875 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 37 treesize of output 26
[2024-03-12 00:42:24,896 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:42:24,897 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 37 treesize of output 26
[2024-03-12 00:42:24,934 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:42:24,934 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 37 treesize of output 26
[2024-03-12 00:42:25,020 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-03-12 00:42:25,059 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:25,059 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:42:25,059 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [926150632] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:25,059 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:42:25,060 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [15] total 37
[2024-03-12 00:42:25,060 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765898342]
[2024-03-12 00:42:25,060 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:25,060 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2024-03-12 00:42:25,060 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:25,061 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-03-12 00:42:25,061 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1245, Unknown=0, NotChecked=0, Total=1406
[2024-03-12 00:42:27,821 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 198
[2024-03-12 00:42:27,823 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 456 transitions, 3986 flow. Second operand  has 24 states, 24 states have (on average 123.16666666666667) internal successors, (2956), 24 states have internal predecessors, (2956), 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-03-12 00:42:27,823 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:27,823 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 198
[2024-03-12 00:42:27,823 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:34,281 INFO  L124   PetriNetUnfolderBase]: 2506/9173 cut-off events.
[2024-03-12 00:42:34,281 INFO  L125   PetriNetUnfolderBase]: For 35994/36041 co-relation queries the response was YES.
[2024-03-12 00:42:34,315 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32384 conditions, 9173 events. 2506/9173 cut-off events. For 35994/36041 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 94413 event pairs, 498 based on Foata normal form. 43/8741 useless extension candidates. Maximal degree in co-relation 29645. Up to 1913 conditions per place. 
[2024-03-12 00:42:34,334 INFO  L140   encePairwiseOnDemand]: 159/198 looper letters, 883 selfloop transitions, 238 changer transitions 28/1287 dead transitions.
[2024-03-12 00:42:34,334 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 1287 transitions, 14874 flow
[2024-03-12 00:42:34,334 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. 
[2024-03-12 00:42:34,334 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 46 states.
[2024-03-12 00:42:34,337 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 5992 transitions.
[2024-03-12 00:42:34,339 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.65788317962231
[2024-03-12 00:42:34,339 INFO  L72            ComplementDD]: Start complementDD. Operand 46 states and 5992 transitions.
[2024-03-12 00:42:34,339 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 46 states and 5992 transitions.
[2024-03-12 00:42:34,340 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:34,340 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 5992 transitions.
[2024-03-12 00:42:34,346 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 47 states, 46 states have (on average 130.2608695652174) internal successors, (5992), 46 states have internal predecessors, (5992), 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-03-12 00:42:34,352 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 47 states, 47 states have (on average 198.0) internal successors, (9306), 47 states have internal predecessors, (9306), 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-03-12 00:42:34,353 INFO  L81            ComplementDD]: Finished complementDD. Result  has 47 states, 47 states have (on average 198.0) internal successors, (9306), 47 states have internal predecessors, (9306), 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-03-12 00:42:34,354 INFO  L175             Difference]: Start difference. First operand has 288 places, 456 transitions, 3986 flow. Second operand 46 states and 5992 transitions.
[2024-03-12 00:42:34,354 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 1287 transitions, 14874 flow
[2024-03-12 00:42:34,489 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 1287 transitions, 14336 flow, removed 135 selfloop flow, removed 9 redundant places.
[2024-03-12 00:42:34,501 INFO  L231             Difference]: Finished difference. Result has 350 places, 672 transitions, 7438 flow
[2024-03-12 00:42:34,502 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=3790, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=7438, PETRI_PLACES=350, PETRI_TRANSITIONS=672}
[2024-03-12 00:42:34,502 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 160 predicate places.
[2024-03-12 00:42:34,502 INFO  L495      AbstractCegarLoop]: Abstraction has has 350 places, 672 transitions, 7438 flow
[2024-03-12 00:42:34,503 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 123.16666666666667) internal successors, (2956), 24 states have internal predecessors, (2956), 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-03-12 00:42:34,503 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:34,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:42:34,509 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-03-12 00:42:34,708 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-03-12 00:42:34,708 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:34,709 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:34,709 INFO  L85        PathProgramCache]: Analyzing trace with hash -1016450842, now seen corresponding path program 1 times
[2024-03-12 00:42:34,709 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:34,709 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441790355]
[2024-03-12 00:42:34,709 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:34,710 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:34,744 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:35,834 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:35,834 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:35,834 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441790355]
[2024-03-12 00:42:35,834 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441790355] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:42:35,835 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059474845]
[2024-03-12 00:42:35,835 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:35,835 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:42:35,835 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:42:35,837 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-03-12 00:42:35,838 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-03-12 00:42:35,964 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:35,980 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 53 conjunts are in the unsatisfiable core
[2024-03-12 00:42:35,988 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:42:36,101 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-03-12 00:42:36,163 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-12 00:42:36,164 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2024-03-12 00:42:36,331 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:42:36,338 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:42:36,338 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18
[2024-03-12 00:42:37,108 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:42:37,108 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44
[2024-03-12 00:42:37,116 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 24 treesize of output 11
[2024-03-12 00:42:37,204 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:42:37,205 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 25 treesize of output 18
[2024-03-12 00:42:37,214 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:42:37,215 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 16 treesize of output 11
[2024-03-12 00:42:37,404 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 12
[2024-03-12 00:42:37,407 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3
[2024-03-12 00:42:37,481 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-03-12 00:42:37,535 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-03-12 00:42:37,595 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-03-12 00:42:37,664 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-03-12 00:42:37,745 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-03-12 00:42:37,815 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:37,815 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 00:42:37,847 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ 3 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse0)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse0)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse0)) 0)))) is different from false
[2024-03-12 00:42:37,871 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ 3 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse2) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) 0)))))) is different from false
[2024-03-12 00:42:37,887 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ 2 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) (.cse2 (+ 3 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse2) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse3) 0)))))) is different from false
[2024-03-12 00:42:38,052 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:42:38,052 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-03-12 00:42:38,058 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:42:38,058 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-03-12 00:42:38,061 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-03-12 00:42:38,067 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 00:42:38,068 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-03-12 00:42:38,073 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 00:42:38,073 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-03-12 00:42:38,078 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 00:42:38,078 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-03-12 00:42:38,179 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_~datas~0.base v_ArrVal_728) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_~datas~0.base))) is different from false
[2024-03-12 00:42:38,337 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_728 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_726) c_~datas~0.base v_ArrVal_728) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_~datas~0.base))) is different from false
[2024-03-12 00:42:38,701 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 163 treesize of output 119
[2024-03-12 00:42:38,706 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 52 treesize of output 50
[2024-03-12 00:42:38,711 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 50 treesize of output 46
[2024-03-12 00:42:38,739 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 8 treesize of output 4
[2024-03-12 00:42:38,930 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:38,930 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059474845] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 00:42:38,930 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 00:42:38,930 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 17] total 53
[2024-03-12 00:42:38,930 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613365982]
[2024-03-12 00:42:38,930 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 00:42:38,931 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 54 states
[2024-03-12 00:42:38,932 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:38,933 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants.
[2024-03-12 00:42:38,934 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2111, Unknown=50, NotChecked=490, Total=2862
[2024-03-12 00:42:39,058 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 198
[2024-03-12 00:42:39,062 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 672 transitions, 7438 flow. Second operand  has 54 states, 54 states have (on average 101.98148148148148) internal successors, (5507), 54 states have internal predecessors, (5507), 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-03-12 00:42:39,062 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:39,062 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 198
[2024-03-12 00:42:39,062 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:58,229 INFO  L124   PetriNetUnfolderBase]: 3723/15058 cut-off events.
[2024-03-12 00:42:58,229 INFO  L125   PetriNetUnfolderBase]: For 65808/65846 co-relation queries the response was YES.
[2024-03-12 00:42:58,312 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50721 conditions, 15058 events. 3723/15058 cut-off events. For 65808/65846 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 174841 event pairs, 378 based on Foata normal form. 83/14475 useless extension candidates. Maximal degree in co-relation 48870. Up to 1580 conditions per place. 
[2024-03-12 00:42:58,339 INFO  L140   encePairwiseOnDemand]: 161/198 looper letters, 886 selfloop transitions, 213 changer transitions 482/1725 dead transitions.
[2024-03-12 00:42:58,339 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 1725 transitions, 21131 flow
[2024-03-12 00:42:58,340 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. 
[2024-03-12 00:42:58,340 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 95 states.
[2024-03-12 00:42:58,345 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 10139 transitions.
[2024-03-12 00:42:58,347 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5390217969165337
[2024-03-12 00:42:58,347 INFO  L72            ComplementDD]: Start complementDD. Operand 95 states and 10139 transitions.
[2024-03-12 00:42:58,347 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 95 states and 10139 transitions.
[2024-03-12 00:42:58,349 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:58,349 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 95 states and 10139 transitions.
[2024-03-12 00:42:58,359 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 96 states, 95 states have (on average 106.72631578947369) internal successors, (10139), 95 states have internal predecessors, (10139), 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-03-12 00:42:58,371 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 96 states, 96 states have (on average 198.0) internal successors, (19008), 96 states have internal predecessors, (19008), 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-03-12 00:42:58,373 INFO  L81            ComplementDD]: Finished complementDD. Result  has 96 states, 96 states have (on average 198.0) internal successors, (19008), 96 states have internal predecessors, (19008), 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-03-12 00:42:58,373 INFO  L175             Difference]: Start difference. First operand has 350 places, 672 transitions, 7438 flow. Second operand 95 states and 10139 transitions.
[2024-03-12 00:42:58,373 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 1725 transitions, 21131 flow
[2024-03-12 00:42:58,721 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 1725 transitions, 20864 flow, removed 112 selfloop flow, removed 11 redundant places.
[2024-03-12 00:42:58,736 INFO  L231             Difference]: Finished difference. Result has 451 places, 628 transitions, 6335 flow
[2024-03-12 00:42:58,736 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=7209, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=95, PETRI_FLOW=6335, PETRI_PLACES=451, PETRI_TRANSITIONS=628}
[2024-03-12 00:42:58,737 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 261 predicate places.
[2024-03-12 00:42:58,737 INFO  L495      AbstractCegarLoop]: Abstraction has has 451 places, 628 transitions, 6335 flow
[2024-03-12 00:42:58,738 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 54 states, 54 states have (on average 101.98148148148148) internal successors, (5507), 54 states have internal predecessors, (5507), 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-03-12 00:42:58,738 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:58,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:42:58,745 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-03-12 00:42:58,938 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:42:58,939 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:58,940 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:58,940 INFO  L85        PathProgramCache]: Analyzing trace with hash 1739739048, now seen corresponding path program 4 times
[2024-03-12 00:42:58,940 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:58,940 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803824173]
[2024-03-12 00:42:58,941 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:58,941 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:58,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:59,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:59,718 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:59,718 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803824173]
[2024-03-12 00:42:59,718 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803824173] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:42:59,718 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991890652]
[2024-03-12 00:42:59,718 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-12 00:42:59,718 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:42:59,718 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:42:59,719 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-03-12 00:42:59,720 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-03-12 00:42:59,962 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-12 00:42:59,962 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:42:59,966 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 70 conjunts are in the unsatisfiable core
[2024-03-12 00:42:59,974 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:43:00,009 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-03-12 00:43:00,127 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:43:00,128 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 15 treesize of output 15
[2024-03-12 00:43:01,038 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-12 00:43:01,039 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24
[2024-03-12 00:43:01,047 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:01,047 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 16 treesize of output 11
[2024-03-12 00:43:01,355 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:01,355 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 26 treesize of output 19
[2024-03-12 00:43:01,370 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:01,370 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 16 treesize of output 11
[2024-03-12 00:43:01,518 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-03-12 00:43:01,591 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-03-12 00:43:01,799 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3
[2024-03-12 00:43:01,814 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13
[2024-03-12 00:43:01,894 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:01,894 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 23 treesize of output 16
[2024-03-12 00:43:01,939 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-03-12 00:43:02,044 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:02,045 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 30 treesize of output 21
[2024-03-12 00:43:02,076 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:02,077 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 30 treesize of output 21
[2024-03-12 00:43:02,103 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:02,104 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 30 treesize of output 21
[2024-03-12 00:43:02,166 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-03-12 00:43:02,293 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 40 treesize of output 48
[2024-03-12 00:43:02,361 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:02,361 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:43:02,361 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [991890652] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:43:02,361 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:43:02,361 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [15] total 33
[2024-03-12 00:43:02,361 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260688289]
[2024-03-12 00:43:02,361 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:43:02,362 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2024-03-12 00:43:02,362 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:43:02,362 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2024-03-12 00:43:02,362 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=993, Unknown=0, NotChecked=0, Total=1122
[2024-03-12 00:43:03,934 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 198
[2024-03-12 00:43:03,935 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 628 transitions, 6335 flow. Second operand  has 20 states, 20 states have (on average 134.9) internal successors, (2698), 20 states have internal predecessors, (2698), 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-03-12 00:43:03,936 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:43:03,936 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 198
[2024-03-12 00:43:03,936 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:43:10,343 INFO  L124   PetriNetUnfolderBase]: 2765/11213 cut-off events.
[2024-03-12 00:43:10,343 INFO  L125   PetriNetUnfolderBase]: For 78450/78611 co-relation queries the response was YES.
[2024-03-12 00:43:10,412 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43593 conditions, 11213 events. 2765/11213 cut-off events. For 78450/78611 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 124192 event pairs, 638 based on Foata normal form. 54/10727 useless extension candidates. Maximal degree in co-relation 43210. Up to 2120 conditions per place. 
[2024-03-12 00:43:10,434 INFO  L140   encePairwiseOnDemand]: 167/198 looper letters, 649 selfloop transitions, 213 changer transitions 39/1060 dead transitions.
[2024-03-12 00:43:10,435 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 1060 transitions, 12662 flow
[2024-03-12 00:43:10,435 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. 
[2024-03-12 00:43:10,436 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 34 states.
[2024-03-12 00:43:10,438 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4875 transitions.
[2024-03-12 00:43:10,439 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7241532976827094
[2024-03-12 00:43:10,439 INFO  L72            ComplementDD]: Start complementDD. Operand 34 states and 4875 transitions.
[2024-03-12 00:43:10,439 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 34 states and 4875 transitions.
[2024-03-12 00:43:10,440 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:43:10,440 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 4875 transitions.
[2024-03-12 00:43:10,444 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 35 states, 34 states have (on average 143.38235294117646) internal successors, (4875), 34 states have internal predecessors, (4875), 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-03-12 00:43:10,448 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 35 states, 35 states have (on average 198.0) internal successors, (6930), 35 states have internal predecessors, (6930), 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-03-12 00:43:10,449 INFO  L81            ComplementDD]: Finished complementDD. Result  has 35 states, 35 states have (on average 198.0) internal successors, (6930), 35 states have internal predecessors, (6930), 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-03-12 00:43:10,449 INFO  L175             Difference]: Start difference. First operand has 451 places, 628 transitions, 6335 flow. Second operand 34 states and 4875 transitions.
[2024-03-12 00:43:10,449 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 1060 transitions, 12662 flow
[2024-03-12 00:43:10,832 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 1060 transitions, 11842 flow, removed 220 selfloop flow, removed 32 redundant places.
[2024-03-12 00:43:10,844 INFO  L231             Difference]: Finished difference. Result has 443 places, 696 transitions, 7578 flow
[2024-03-12 00:43:10,844 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=5754, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=7578, PETRI_PLACES=443, PETRI_TRANSITIONS=696}
[2024-03-12 00:43:10,845 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 253 predicate places.
[2024-03-12 00:43:10,845 INFO  L495      AbstractCegarLoop]: Abstraction has has 443 places, 696 transitions, 7578 flow
[2024-03-12 00:43:10,845 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 20 states have (on average 134.9) internal successors, (2698), 20 states have internal predecessors, (2698), 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-03-12 00:43:10,845 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:43:10,845 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:43:10,852 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-03-12 00:43:11,046 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:43:11,046 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:43:11,047 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:43:11,047 INFO  L85        PathProgramCache]: Analyzing trace with hash -299896556, now seen corresponding path program 5 times
[2024-03-12 00:43:11,048 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:43:11,048 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751720985]
[2024-03-12 00:43:11,048 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:11,048 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:43:11,069 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:11,817 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:11,817 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:43:11,817 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751720985]
[2024-03-12 00:43:11,817 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751720985] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:43:11,817 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41047500]
[2024-03-12 00:43:11,817 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-03-12 00:43:11,817 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:43:11,818 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:43:11,818 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-03-12 00:43:11,819 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-03-12 00:43:11,975 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-12 00:43:11,976 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:43:11,977 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 38 conjunts are in the unsatisfiable core
[2024-03-12 00:43:11,982 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:43:12,003 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-03-12 00:43:12,062 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:43:12,062 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 15 treesize of output 15
[2024-03-12 00:43:12,423 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:43:12,424 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-03-12 00:43:12,470 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:12,471 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 26 treesize of output 19
[2024-03-12 00:43:12,538 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 15 treesize of output 11
[2024-03-12 00:43:12,578 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 28 treesize of output 27
[2024-03-12 00:43:12,640 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13
[2024-03-12 00:43:12,709 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:43:12,709 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 40 treesize of output 42
[2024-03-12 00:43:12,784 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:43:12,784 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 52 treesize of output 57
[2024-03-12 00:43:12,874 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:12,875 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 56 treesize of output 45
[2024-03-12 00:43:12,907 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:12,908 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 56 treesize of output 45
[2024-03-12 00:43:12,942 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:12,943 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 56 treesize of output 45
[2024-03-12 00:43:12,972 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:12,972 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 56 treesize of output 45
[2024-03-12 00:43:13,020 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 56 treesize of output 45
[2024-03-12 00:43:13,037 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:43:13,037 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:43:13,037 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [41047500] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:43:13,037 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:43:13,037 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-03-12 00:43:13,038 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095128443]
[2024-03-12 00:43:13,038 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:43:13,038 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-12 00:43:13,039 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:43:13,039 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-12 00:43:13,039 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702
[2024-03-12 00:43:14,239 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 198
[2024-03-12 00:43:14,240 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 696 transitions, 7578 flow. Second operand  has 15 states, 15 states have (on average 146.2) internal successors, (2193), 15 states have internal predecessors, (2193), 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-03-12 00:43:14,240 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:43:14,240 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 198
[2024-03-12 00:43:14,240 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:43:18,197 INFO  L124   PetriNetUnfolderBase]: 2270/10297 cut-off events.
[2024-03-12 00:43:18,198 INFO  L125   PetriNetUnfolderBase]: For 73738/73963 co-relation queries the response was YES.
[2024-03-12 00:43:18,261 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39580 conditions, 10297 events. 2270/10297 cut-off events. For 73738/73963 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 114664 event pairs, 333 based on Foata normal form. 123/9991 useless extension candidates. Maximal degree in co-relation 39264. Up to 1266 conditions per place. 
[2024-03-12 00:43:18,283 INFO  L140   encePairwiseOnDemand]: 178/198 looper letters, 333 selfloop transitions, 258 changer transitions 54/869 dead transitions.
[2024-03-12 00:43:18,283 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 869 transitions, 10758 flow
[2024-03-12 00:43:18,284 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2024-03-12 00:43:18,284 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2024-03-12 00:43:18,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3330 transitions.
[2024-03-12 00:43:18,286 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7644628099173554
[2024-03-12 00:43:18,286 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 3330 transitions.
[2024-03-12 00:43:18,286 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 3330 transitions.
[2024-03-12 00:43:18,287 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:43:18,287 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3330 transitions.
[2024-03-12 00:43:18,290 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 151.36363636363637) internal successors, (3330), 22 states have internal predecessors, (3330), 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-03-12 00:43:18,293 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 198.0) internal successors, (4554), 23 states have internal predecessors, (4554), 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-03-12 00:43:18,293 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 198.0) internal successors, (4554), 23 states have internal predecessors, (4554), 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-03-12 00:43:18,293 INFO  L175             Difference]: Start difference. First operand has 443 places, 696 transitions, 7578 flow. Second operand 22 states and 3330 transitions.
[2024-03-12 00:43:18,293 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 869 transitions, 10758 flow
[2024-03-12 00:43:18,696 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 869 transitions, 10440 flow, removed 89 selfloop flow, removed 19 redundant places.
[2024-03-12 00:43:18,706 INFO  L231             Difference]: Finished difference. Result has 450 places, 717 transitions, 8590 flow
[2024-03-12 00:43:18,707 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=7321, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=8590, PETRI_PLACES=450, PETRI_TRANSITIONS=717}
[2024-03-12 00:43:18,707 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 260 predicate places.
[2024-03-12 00:43:18,707 INFO  L495      AbstractCegarLoop]: Abstraction has has 450 places, 717 transitions, 8590 flow
[2024-03-12 00:43:18,708 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 146.2) internal successors, (2193), 15 states have internal predecessors, (2193), 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-03-12 00:43:18,708 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:43:18,708 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:43:18,715 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-03-12 00:43:18,908 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:43:18,909 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:43:18,909 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:43:18,909 INFO  L85        PathProgramCache]: Analyzing trace with hash -1527349223, now seen corresponding path program 1 times
[2024-03-12 00:43:18,910 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:43:18,910 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627380084]
[2024-03-12 00:43:18,910 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:18,910 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:43:18,937 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:19,632 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:19,632 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:43:19,632 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627380084]
[2024-03-12 00:43:19,632 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627380084] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:43:19,633 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789961813]
[2024-03-12 00:43:19,633 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:19,633 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:43:19,633 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:43:19,634 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-03-12 00:43:19,636 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-03-12 00:43:19,789 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:19,791 INFO  L262         TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 42 conjunts are in the unsatisfiable core
[2024-03-12 00:43:19,797 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:43:19,808 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-03-12 00:43:19,826 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-12 00:43:19,826 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2024-03-12 00:43:19,884 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:19,896 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:43:19,896 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18
[2024-03-12 00:43:20,252 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:43:20,252 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32
[2024-03-12 00:43:20,293 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:20,293 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 25 treesize of output 18
[2024-03-12 00:43:20,351 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 15 treesize of output 11
[2024-03-12 00:43:20,388 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 12
[2024-03-12 00:43:20,442 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 28 treesize of output 27
[2024-03-12 00:43:20,510 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:43:20,510 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 40 treesize of output 42
[2024-03-12 00:43:20,573 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:43:20,574 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 52 treesize of output 57
[2024-03-12 00:43:20,642 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:20,643 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:43:20,670 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:20,671 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:43:20,693 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:20,693 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:43:20,712 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:20,713 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:43:20,764 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 56 treesize of output 45
[2024-03-12 00:43:20,776 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:43:20,776 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:43:20,777 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [789961813] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:43:20,777 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:43:20,777 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 25
[2024-03-12 00:43:20,777 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319955650]
[2024-03-12 00:43:20,778 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:43:20,778 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-12 00:43:20,778 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:43:20,779 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-12 00:43:20,779 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650
[2024-03-12 00:43:21,544 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 143 out of 198
[2024-03-12 00:43:21,545 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 717 transitions, 8590 flow. Second operand  has 15 states, 15 states have (on average 145.2) internal successors, (2178), 15 states have internal predecessors, (2178), 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-03-12 00:43:21,545 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:43:21,545 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 198
[2024-03-12 00:43:21,545 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:43:25,191 INFO  L124   PetriNetUnfolderBase]: 2163/9720 cut-off events.
[2024-03-12 00:43:25,192 INFO  L125   PetriNetUnfolderBase]: For 78990/79230 co-relation queries the response was YES.
[2024-03-12 00:43:25,260 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38610 conditions, 9720 events. 2163/9720 cut-off events. For 78990/79230 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 106613 event pairs, 319 based on Foata normal form. 78/9381 useless extension candidates. Maximal degree in co-relation 38240. Up to 1087 conditions per place. 
[2024-03-12 00:43:25,281 INFO  L140   encePairwiseOnDemand]: 178/198 looper letters, 327 selfloop transitions, 219 changer transitions 73/841 dead transitions.
[2024-03-12 00:43:25,281 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 841 transitions, 11060 flow
[2024-03-12 00:43:25,282 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2024-03-12 00:43:25,283 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2024-03-12 00:43:25,284 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3008 transitions.
[2024-03-12 00:43:25,285 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7595959595959596
[2024-03-12 00:43:25,285 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 3008 transitions.
[2024-03-12 00:43:25,285 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 3008 transitions.
[2024-03-12 00:43:25,286 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:43:25,286 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3008 transitions.
[2024-03-12 00:43:25,289 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 150.4) internal successors, (3008), 20 states have internal predecessors, (3008), 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-03-12 00:43:25,292 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 198.0) internal successors, (4158), 21 states have internal predecessors, (4158), 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-03-12 00:43:25,292 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 198.0) internal successors, (4158), 21 states have internal predecessors, (4158), 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-03-12 00:43:25,292 INFO  L175             Difference]: Start difference. First operand has 450 places, 717 transitions, 8590 flow. Second operand 20 states and 3008 transitions.
[2024-03-12 00:43:25,292 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 841 transitions, 11060 flow
[2024-03-12 00:43:25,735 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 841 transitions, 10595 flow, removed 98 selfloop flow, removed 17 redundant places.
[2024-03-12 00:43:25,746 INFO  L231             Difference]: Finished difference. Result has 457 places, 681 transitions, 8413 flow
[2024-03-12 00:43:25,746 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=8174, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=717, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=8413, PETRI_PLACES=457, PETRI_TRANSITIONS=681}
[2024-03-12 00:43:25,747 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 267 predicate places.
[2024-03-12 00:43:25,747 INFO  L495      AbstractCegarLoop]: Abstraction has has 457 places, 681 transitions, 8413 flow
[2024-03-12 00:43:25,747 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 145.2) internal successors, (2178), 15 states have internal predecessors, (2178), 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-03-12 00:43:25,747 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:43:25,748 INFO  L208   CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:43:25,754 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-03-12 00:43:25,948 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,SelfDestructingSolverStorable21
[2024-03-12 00:43:25,949 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:43:25,950 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:43:25,951 INFO  L85        PathProgramCache]: Analyzing trace with hash -1439928990, now seen corresponding path program 1 times
[2024-03-12 00:43:25,951 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:43:25,951 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190878027]
[2024-03-12 00:43:25,952 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:25,952 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:43:25,973 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:26,032 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:26,032 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:43:26,032 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190878027]
[2024-03-12 00:43:26,033 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190878027] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:43:26,034 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:43:26,034 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-12 00:43:26,034 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233577968]
[2024-03-12 00:43:26,034 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:43:26,034 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:43:26,035 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:43:26,035 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:43:26,036 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:43:26,047 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 187 out of 198
[2024-03-12 00:43:26,048 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 681 transitions, 8413 flow. Second operand  has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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-03-12 00:43:26,048 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:43:26,048 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 198
[2024-03-12 00:43:26,048 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:43:27,158 INFO  L124   PetriNetUnfolderBase]: 1080/5741 cut-off events.
[2024-03-12 00:43:27,158 INFO  L125   PetriNetUnfolderBase]: For 61714/61829 co-relation queries the response was YES.
[2024-03-12 00:43:27,199 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24486 conditions, 5741 events. 1080/5741 cut-off events. For 61714/61829 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 57938 event pairs, 56 based on Foata normal form. 17/5601 useless extension candidates. Maximal degree in co-relation 24224. Up to 836 conditions per place. 
[2024-03-12 00:43:27,211 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 3 selfloop transitions, 4 changer transitions 0/656 dead transitions.
[2024-03-12 00:43:27,211 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 656 transitions, 8293 flow
[2024-03-12 00:43:27,212 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:43:27,212 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:43:27,213 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions.
[2024-03-12 00:43:27,213 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9579124579124579
[2024-03-12 00:43:27,213 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 569 transitions.
[2024-03-12 00:43:27,213 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 569 transitions.
[2024-03-12 00:43:27,214 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:43:27,214 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 569 transitions.
[2024-03-12 00:43:27,214 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 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-03-12 00:43:27,215 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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-03-12 00:43:27,215 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 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-03-12 00:43:27,215 INFO  L175             Difference]: Start difference. First operand has 457 places, 681 transitions, 8413 flow. Second operand 3 states and 569 transitions.
[2024-03-12 00:43:27,215 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 656 transitions, 8293 flow
[2024-03-12 00:43:27,509 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 656 transitions, 7730 flow, removed 38 selfloop flow, removed 33 redundant places.
[2024-03-12 00:43:27,517 INFO  L231             Difference]: Finished difference. Result has 417 places, 656 transitions, 7724 flow
[2024-03-12 00:43:27,517 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=7716, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7724, PETRI_PLACES=417, PETRI_TRANSITIONS=656}
[2024-03-12 00:43:27,518 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 227 predicate places.
[2024-03-12 00:43:27,518 INFO  L495      AbstractCegarLoop]: Abstraction has has 417 places, 656 transitions, 7724 flow
[2024-03-12 00:43:27,518 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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-03-12 00:43:27,518 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:43:27,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:43:27,519 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-03-12 00:43:27,519 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:43:27,519 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:43:27,519 INFO  L85        PathProgramCache]: Analyzing trace with hash 190944379, now seen corresponding path program 1 times
[2024-03-12 00:43:27,519 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:43:27,519 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053980878]
[2024-03-12 00:43:27,520 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:27,520 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:43:27,539 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:27,611 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:27,612 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:43:27,612 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053980878]
[2024-03-12 00:43:27,612 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053980878] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:43:27,612 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125992361]
[2024-03-12 00:43:27,612 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:27,612 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:43:27,612 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:43:27,613 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-03-12 00:43:27,615 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-03-12 00:43:27,766 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:27,767 INFO  L262         TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-12 00:43:27,768 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:43:27,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-03-12 00:43:27,860 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 00:43:27,969 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:27,969 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125992361] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 00:43:27,969 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 00:43:27,969 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9
[2024-03-12 00:43:27,969 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796702846]
[2024-03-12 00:43:27,970 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 00:43:27,970 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-12 00:43:27,970 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:43:27,970 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-12 00:43:27,971 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-12 00:43:28,107 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 175 out of 198
[2024-03-12 00:43:28,108 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 656 transitions, 7724 flow. Second operand  has 9 states, 9 states have (on average 177.55555555555554) internal successors, (1598), 9 states have internal predecessors, (1598), 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-03-12 00:43:28,108 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:43:28,108 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 198
[2024-03-12 00:43:28,108 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:43:28,992 INFO  L124   PetriNetUnfolderBase]: 912/4591 cut-off events.
[2024-03-12 00:43:28,992 INFO  L125   PetriNetUnfolderBase]: For 41256/41377 co-relation queries the response was YES.
[2024-03-12 00:43:29,022 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18655 conditions, 4591 events. 912/4591 cut-off events. For 41256/41377 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 42632 event pairs, 41 based on Foata normal form. 34/4493 useless extension candidates. Maximal degree in co-relation 18564. Up to 708 conditions per place. 
[2024-03-12 00:43:29,032 INFO  L140   encePairwiseOnDemand]: 191/198 looper letters, 17 selfloop transitions, 26 changer transitions 1/555 dead transitions.
[2024-03-12 00:43:29,032 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 555 transitions, 6730 flow
[2024-03-12 00:43:29,033 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-03-12 00:43:29,033 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-03-12 00:43:29,034 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1249 transitions.
[2024-03-12 00:43:29,034 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9011544011544012
[2024-03-12 00:43:29,034 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1249 transitions.
[2024-03-12 00:43:29,034 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1249 transitions.
[2024-03-12 00:43:29,035 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:43:29,035 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1249 transitions.
[2024-03-12 00:43:29,036 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 178.42857142857142) internal successors, (1249), 7 states have internal predecessors, (1249), 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-03-12 00:43:29,037 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 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-03-12 00:43:29,037 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 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-03-12 00:43:29,037 INFO  L175             Difference]: Start difference. First operand has 417 places, 656 transitions, 7724 flow. Second operand 7 states and 1249 transitions.
[2024-03-12 00:43:29,038 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 555 transitions, 6730 flow
[2024-03-12 00:43:29,177 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 555 transitions, 5964 flow, removed 14 selfloop flow, removed 22 redundant places.
[2024-03-12 00:43:29,183 INFO  L231             Difference]: Finished difference. Result has 357 places, 547 transitions, 5908 flow
[2024-03-12 00:43:29,183 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=5850, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5908, PETRI_PLACES=357, PETRI_TRANSITIONS=547}
[2024-03-12 00:43:29,184 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 167 predicate places.
[2024-03-12 00:43:29,184 INFO  L495      AbstractCegarLoop]: Abstraction has has 357 places, 547 transitions, 5908 flow
[2024-03-12 00:43:29,184 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 177.55555555555554) internal successors, (1598), 9 states have internal predecessors, (1598), 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-03-12 00:43:29,184 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:43:29,184 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:43:29,193 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-03-12 00:43:29,385 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23
[2024-03-12 00:43:29,386 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:43:29,386 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:43:29,386 INFO  L85        PathProgramCache]: Analyzing trace with hash -366618917, now seen corresponding path program 1 times
[2024-03-12 00:43:29,387 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:43:29,387 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55272070]
[2024-03-12 00:43:29,387 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:29,387 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:43:29,404 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:29,493 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-03-12 00:43:29,493 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:43:29,493 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55272070]
[2024-03-12 00:43:29,493 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55272070] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:43:29,494 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026151897]
[2024-03-12 00:43:29,494 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:29,494 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:43:29,494 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:43:29,495 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:43:29,497 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-03-12 00:43:29,641 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:29,642 INFO  L262         TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjunts are in the unsatisfiable core
[2024-03-12 00:43:29,644 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:43:29,776 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:29,776 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:43:29,776 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026151897] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:43:29,777 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:43:29,777 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 10
[2024-03-12 00:43:29,777 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882208083]
[2024-03-12 00:43:29,777 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:43:29,777 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-03-12 00:43:29,778 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:43:29,778 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-03-12 00:43:29,778 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-12 00:43:29,848 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 172 out of 198
[2024-03-12 00:43:29,848 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 547 transitions, 5908 flow. Second operand  has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 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-03-12 00:43:29,849 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:43:29,849 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 198
[2024-03-12 00:43:29,849 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:43:30,685 INFO  L124   PetriNetUnfolderBase]: 879/4464 cut-off events.
[2024-03-12 00:43:30,685 INFO  L125   PetriNetUnfolderBase]: For 33351/33426 co-relation queries the response was YES.
[2024-03-12 00:43:30,707 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16678 conditions, 4464 events. 879/4464 cut-off events. For 33351/33426 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 41012 event pairs, 40 based on Foata normal form. 24/4361 useless extension candidates. Maximal degree in co-relation 16603. Up to 696 conditions per place. 
[2024-03-12 00:43:30,715 INFO  L140   encePairwiseOnDemand]: 187/198 looper letters, 32 selfloop transitions, 16 changer transitions 0/570 dead transitions.
[2024-03-12 00:43:30,715 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 570 transitions, 6069 flow
[2024-03-12 00:43:30,716 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-12 00:43:30,716 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-12 00:43:30,717 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1940 transitions.
[2024-03-12 00:43:30,717 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8907254361799817
[2024-03-12 00:43:30,718 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1940 transitions.
[2024-03-12 00:43:30,718 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1940 transitions.
[2024-03-12 00:43:30,718 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:43:30,718 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1940 transitions.
[2024-03-12 00:43:30,720 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 176.36363636363637) internal successors, (1940), 11 states have internal predecessors, (1940), 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-03-12 00:43:30,721 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 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-03-12 00:43:30,721 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 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-03-12 00:43:30,721 INFO  L175             Difference]: Start difference. First operand has 357 places, 547 transitions, 5908 flow. Second operand 11 states and 1940 transitions.
[2024-03-12 00:43:30,721 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 570 transitions, 6069 flow
[2024-03-12 00:43:30,814 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 570 transitions, 6022 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-03-12 00:43:30,821 INFO  L231             Difference]: Finished difference. Result has 368 places, 557 transitions, 5953 flow
[2024-03-12 00:43:30,822 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=5861, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5953, PETRI_PLACES=368, PETRI_TRANSITIONS=557}
[2024-03-12 00:43:30,822 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 178 predicate places.
[2024-03-12 00:43:30,822 INFO  L495      AbstractCegarLoop]: Abstraction has has 368 places, 557 transitions, 5953 flow
[2024-03-12 00:43:30,822 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 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-03-12 00:43:30,823 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:43:30,823 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:43:30,830 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-03-12 00:43:31,023 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:43:31,024 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:43:31,025 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:43:31,025 INFO  L85        PathProgramCache]: Analyzing trace with hash 1272306485, now seen corresponding path program 1 times
[2024-03-12 00:43:31,025 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:43:31,026 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303921674]
[2024-03-12 00:43:31,026 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:31,026 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:43:31,047 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:31,137 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:31,138 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:43:31,138 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303921674]
[2024-03-12 00:43:31,138 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303921674] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:43:31,138 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880607029]
[2024-03-12 00:43:31,138 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:31,138 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:43:31,138 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:43:31,139 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:43:31,146 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-03-12 00:43:31,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:31,270 INFO  L262         TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 7 conjunts are in the unsatisfiable core
[2024-03-12 00:43:31,272 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:43:31,399 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:31,399 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 00:43:31,578 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:31,578 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [880607029] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 00:43:31,578 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 00:43:31,578 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11
[2024-03-12 00:43:31,579 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149503166]
[2024-03-12 00:43:31,579 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 00:43:31,579 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-03-12 00:43:31,580 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:43:31,580 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-03-12 00:43:31,580 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2024-03-12 00:43:31,725 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 174 out of 198
[2024-03-12 00:43:31,726 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 557 transitions, 5953 flow. Second operand  has 11 states, 11 states have (on average 176.45454545454547) internal successors, (1941), 11 states have internal predecessors, (1941), 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-03-12 00:43:31,726 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:43:31,727 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 198
[2024-03-12 00:43:31,727 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:43:32,641 INFO  L124   PetriNetUnfolderBase]: 921/4647 cut-off events.
[2024-03-12 00:43:32,641 INFO  L125   PetriNetUnfolderBase]: For 34336/34409 co-relation queries the response was YES.
[2024-03-12 00:43:32,664 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17768 conditions, 4647 events. 921/4647 cut-off events. For 34336/34409 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 42871 event pairs, 42 based on Foata normal form. 19/4553 useless extension candidates. Maximal degree in co-relation 17688. Up to 756 conditions per place. 
[2024-03-12 00:43:32,673 INFO  L140   encePairwiseOnDemand]: 188/198 looper letters, 36 selfloop transitions, 15 changer transitions 0/578 dead transitions.
[2024-03-12 00:43:32,673 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 578 transitions, 6142 flow
[2024-03-12 00:43:32,673 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 00:43:32,674 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 00:43:32,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1783 transitions.
[2024-03-12 00:43:32,675 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9005050505050505
[2024-03-12 00:43:32,675 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1783 transitions.
[2024-03-12 00:43:32,675 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1783 transitions.
[2024-03-12 00:43:32,676 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:43:32,676 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1783 transitions.
[2024-03-12 00:43:32,677 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 178.3) internal successors, (1783), 10 states have internal predecessors, (1783), 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-03-12 00:43:32,678 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 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-03-12 00:43:32,678 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 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-03-12 00:43:32,678 INFO  L175             Difference]: Start difference. First operand has 368 places, 557 transitions, 5953 flow. Second operand 10 states and 1783 transitions.
[2024-03-12 00:43:32,679 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 578 transitions, 6142 flow
[2024-03-12 00:43:32,780 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 578 transitions, 6128 flow, removed 4 selfloop flow, removed 2 redundant places.
[2024-03-12 00:43:32,786 INFO  L231             Difference]: Finished difference. Result has 379 places, 567 transitions, 6050 flow
[2024-03-12 00:43:32,787 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=5943, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6050, PETRI_PLACES=379, PETRI_TRANSITIONS=567}
[2024-03-12 00:43:32,787 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 189 predicate places.
[2024-03-12 00:43:32,788 INFO  L495      AbstractCegarLoop]: Abstraction has has 379 places, 567 transitions, 6050 flow
[2024-03-12 00:43:32,788 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 176.45454545454547) internal successors, (1941), 11 states have internal predecessors, (1941), 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-03-12 00:43:32,788 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:43:32,788 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:43:32,794 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2024-03-12 00:43:32,989 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25
[2024-03-12 00:43:32,990 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:43:32,990 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:43:32,990 INFO  L85        PathProgramCache]: Analyzing trace with hash 902056160, now seen corresponding path program 1 times
[2024-03-12 00:43:32,991 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:43:32,991 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985208489]
[2024-03-12 00:43:32,991 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:32,992 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:43:33,018 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 00:43:33,018 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 00:43:33,031 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 00:43:33,062 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 00:43:33,062 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 00:43:33,063 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining)
[2024-03-12 00:43:33,066 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2024-03-12 00:43:33,066 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2024-03-12 00:43:33,067 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2024-03-12 00:43:33,067 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2024-03-12 00:43:33,067 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2024-03-12 00:43:33,068 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2024-03-12 00:43:33,068 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2024-03-12 00:43:33,068 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2024-03-12 00:43:33,068 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining)
[2024-03-12 00:43:33,069 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2024-03-12 00:43:33,069 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2024-03-12 00:43:33,069 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2024-03-12 00:43:33,069 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2024-03-12 00:43:33,070 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2024-03-12 00:43:33,070 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2024-03-12 00:43:33,070 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2024-03-12 00:43:33,070 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2024-03-12 00:43:33,070 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-03-12 00:43:33,071 INFO  L445         BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:43:33,073 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 00:43:33,074 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-12 00:43:33,095 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-12 00:43:33,098 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 239 places, 249 transitions, 514 flow
[2024-03-12 00:43:33,138 INFO  L124   PetriNetUnfolderBase]: 27/482 cut-off events.
[2024-03-12 00:43:33,138 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-12 00:43:33,140 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 494 conditions, 482 events. 27/482 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1193 event pairs, 0 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 289. Up to 9 conditions per place. 
[2024-03-12 00:43:33,140 INFO  L82        GeneralOperation]: Start removeDead. Operand has 239 places, 249 transitions, 514 flow
[2024-03-12 00:43:33,142 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 239 places, 249 transitions, 514 flow
[2024-03-12 00:43:33,143 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 00:43:33,143 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;@4fd38098, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 00:43:33,144 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 22 error locations.
[2024-03-12 00:43:33,146 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 00:43:33,146 INFO  L124   PetriNetUnfolderBase]: 2/41 cut-off events.
[2024-03-12 00:43:33,146 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 00:43:33,146 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:43:33,146 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]
[2024-03-12 00:43:33,147 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:43:33,147 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:43:33,147 INFO  L85        PathProgramCache]: Analyzing trace with hash 1685596353, now seen corresponding path program 1 times
[2024-03-12 00:43:33,147 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:43:33,147 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929018351]
[2024-03-12 00:43:33,147 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:33,147 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:43:33,155 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:33,163 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:33,163 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:43:33,164 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929018351]
[2024-03-12 00:43:33,164 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929018351] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:43:33,164 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:43:33,164 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:43:33,164 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546827879]
[2024-03-12 00:43:33,164 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:43:33,164 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:43:33,165 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:43:33,165 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:43:33,171 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:43:33,192 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-03-12 00:43:33,193 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 249 transitions, 514 flow. Second operand  has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 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-03-12 00:43:33,193 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:43:33,193 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-03-12 00:43:33,193 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:43:33,434 INFO  L124   PetriNetUnfolderBase]: 237/2093 cut-off events.
[2024-03-12 00:43:33,435 INFO  L125   PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES.
[2024-03-12 00:43:33,442 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2380 conditions, 2093 events. 237/2093 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 14919 event pairs, 132 based on Foata normal form. 41/1821 useless extension candidates. Maximal degree in co-relation 1763. Up to 258 conditions per place. 
[2024-03-12 00:43:33,446 INFO  L140   encePairwiseOnDemand]: 242/249 looper letters, 17 selfloop transitions, 2 changer transitions 2/244 dead transitions.
[2024-03-12 00:43:33,446 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 244 transitions, 542 flow
[2024-03-12 00:43:33,447 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:43:33,447 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:43:33,448 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions.
[2024-03-12 00:43:33,448 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9357429718875502
[2024-03-12 00:43:33,448 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 699 transitions.
[2024-03-12 00:43:33,448 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 699 transitions.
[2024-03-12 00:43:33,448 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:43:33,449 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 699 transitions.
[2024-03-12 00:43:33,449 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 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-03-12 00:43:33,450 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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-03-12 00:43:33,450 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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-03-12 00:43:33,450 INFO  L175             Difference]: Start difference. First operand has 239 places, 249 transitions, 514 flow. Second operand 3 states and 699 transitions.
[2024-03-12 00:43:33,450 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 244 transitions, 542 flow
[2024-03-12 00:43:33,451 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 244 transitions, 542 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:43:33,453 INFO  L231             Difference]: Finished difference. Result has 240 places, 242 transitions, 504 flow
[2024-03-12 00:43:33,453 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=240, PETRI_TRANSITIONS=242}
[2024-03-12 00:43:33,454 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 1 predicate places.
[2024-03-12 00:43:33,454 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 242 transitions, 504 flow
[2024-03-12 00:43:33,454 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 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-03-12 00:43:33,454 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:43:33,454 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]
[2024-03-12 00:43:33,454 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-03-12 00:43:33,455 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:43:33,455 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:43:33,455 INFO  L85        PathProgramCache]: Analyzing trace with hash 2081762899, now seen corresponding path program 1 times
[2024-03-12 00:43:33,455 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:43:33,455 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661824880]
[2024-03-12 00:43:33,455 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:33,455 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:43:33,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:33,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:33,472 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:43:33,472 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661824880]
[2024-03-12 00:43:33,472 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661824880] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:43:33,472 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:43:33,472 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:43:33,472 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851682874]
[2024-03-12 00:43:33,472 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:43:33,473 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:43:33,473 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:43:33,473 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:43:33,473 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:43:33,500 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 220 out of 249
[2024-03-12 00:43:33,500 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 242 transitions, 504 flow. Second operand  has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 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-03-12 00:43:33,501 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:43:33,501 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 249
[2024-03-12 00:43:33,501 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:43:34,101 INFO  L124   PetriNetUnfolderBase]: 1364/6164 cut-off events.
[2024-03-12 00:43:34,101 INFO  L125   PetriNetUnfolderBase]: For 119/131 co-relation queries the response was YES.
[2024-03-12 00:43:34,119 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7813 conditions, 6164 events. 1364/6164 cut-off events. For 119/131 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 59059 event pairs, 374 based on Foata normal form. 1/5216 useless extension candidates. Maximal degree in co-relation 7766. Up to 850 conditions per place. 
[2024-03-12 00:43:34,136 INFO  L140   encePairwiseOnDemand]: 234/249 looper letters, 34 selfloop transitions, 11 changer transitions 0/262 dead transitions.
[2024-03-12 00:43:34,136 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 262 transitions, 645 flow
[2024-03-12 00:43:34,137 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:43:34,137 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:43:34,138 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 709 transitions.
[2024-03-12 00:43:34,138 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9491298527443106
[2024-03-12 00:43:34,138 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 709 transitions.
[2024-03-12 00:43:34,138 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 709 transitions.
[2024-03-12 00:43:34,138 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:43:34,139 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 709 transitions.
[2024-03-12 00:43:34,139 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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-03-12 00:43:34,140 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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-03-12 00:43:34,140 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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-03-12 00:43:34,140 INFO  L175             Difference]: Start difference. First operand has 240 places, 242 transitions, 504 flow. Second operand 3 states and 709 transitions.
[2024-03-12 00:43:34,140 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 262 transitions, 645 flow
[2024-03-12 00:43:34,142 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 262 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:43:34,144 INFO  L231             Difference]: Finished difference. Result has 240 places, 253 transitions, 596 flow
[2024-03-12 00:43:34,144 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=240, PETRI_TRANSITIONS=253}
[2024-03-12 00:43:34,144 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 1 predicate places.
[2024-03-12 00:43:34,145 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 253 transitions, 596 flow
[2024-03-12 00:43:34,145 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 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-03-12 00:43:34,145 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:43:34,145 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]
[2024-03-12 00:43:34,145 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-03-12 00:43:34,145 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:43:34,145 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:43:34,146 INFO  L85        PathProgramCache]: Analyzing trace with hash -623349496, now seen corresponding path program 1 times
[2024-03-12 00:43:34,146 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:43:34,146 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464659456]
[2024-03-12 00:43:34,146 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:34,146 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:43:34,154 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:34,182 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:34,183 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:43:34,183 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464659456]
[2024-03-12 00:43:34,183 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464659456] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:43:34,183 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:43:34,183 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:43:34,183 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009743253]
[2024-03-12 00:43:34,183 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:43:34,184 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 00:43:34,184 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:43:34,184 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 00:43:34,184 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 00:43:34,245 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 224 out of 249
[2024-03-12 00:43:34,246 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 253 transitions, 596 flow. Second operand  has 5 states, 5 states have (on average 225.4) internal successors, (1127), 5 states have internal predecessors, (1127), 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-03-12 00:43:34,246 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:43:34,246 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 249
[2024-03-12 00:43:34,246 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:43:34,885 INFO  L124   PetriNetUnfolderBase]: 864/5441 cut-off events.
[2024-03-12 00:43:34,886 INFO  L125   PetriNetUnfolderBase]: For 273/281 co-relation queries the response was YES.
[2024-03-12 00:43:34,904 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7046 conditions, 5441 events. 864/5441 cut-off events. For 273/281 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 53225 event pairs, 269 based on Foata normal form. 1/4677 useless extension candidates. Maximal degree in co-relation 3901. Up to 569 conditions per place. 
[2024-03-12 00:43:34,918 INFO  L140   encePairwiseOnDemand]: 241/249 looper letters, 24 selfloop transitions, 6 changer transitions 1/263 dead transitions.
[2024-03-12 00:43:34,918 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 263 transitions, 678 flow
[2024-03-12 00:43:34,919 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:43:34,919 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:43:34,920 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1376 transitions.
[2024-03-12 00:43:34,920 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9210174029451138
[2024-03-12 00:43:34,921 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1376 transitions.
[2024-03-12 00:43:34,921 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1376 transitions.
[2024-03-12 00:43:34,921 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:43:34,921 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1376 transitions.
[2024-03-12 00:43:34,922 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 229.33333333333334) internal successors, (1376), 6 states have internal predecessors, (1376), 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-03-12 00:43:34,923 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 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-03-12 00:43:34,924 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 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-03-12 00:43:34,924 INFO  L175             Difference]: Start difference. First operand has 240 places, 253 transitions, 596 flow. Second operand 6 states and 1376 transitions.
[2024-03-12 00:43:34,924 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 263 transitions, 678 flow
[2024-03-12 00:43:34,927 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 263 transitions, 656 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:43:34,930 INFO  L231             Difference]: Finished difference. Result has 247 places, 258 transitions, 620 flow
[2024-03-12 00:43:34,930 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=620, PETRI_PLACES=247, PETRI_TRANSITIONS=258}
[2024-03-12 00:43:34,932 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 8 predicate places.
[2024-03-12 00:43:34,933 INFO  L495      AbstractCegarLoop]: Abstraction has has 247 places, 258 transitions, 620 flow
[2024-03-12 00:43:34,933 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 225.4) internal successors, (1127), 5 states have internal predecessors, (1127), 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-03-12 00:43:34,933 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:43:34,933 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]
[2024-03-12 00:43:34,933 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-03-12 00:43:34,933 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:43:34,934 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:43:34,934 INFO  L85        PathProgramCache]: Analyzing trace with hash 993495992, now seen corresponding path program 1 times
[2024-03-12 00:43:34,934 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:43:34,934 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155372094]
[2024-03-12 00:43:34,934 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:34,935 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:43:34,944 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:35,087 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:35,088 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:43:35,088 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155372094]
[2024-03-12 00:43:35,088 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155372094] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:43:35,088 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:43:35,088 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:43:35,088 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011333576]
[2024-03-12 00:43:35,088 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:43:35,088 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:43:35,089 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:43:35,089 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:43:35,089 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:43:35,271 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 205 out of 249
[2024-03-12 00:43:35,272 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 258 transitions, 620 flow. Second operand  has 6 states, 6 states have (on average 206.16666666666666) internal successors, (1237), 6 states have internal predecessors, (1237), 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-03-12 00:43:35,273 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:43:35,273 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 249
[2024-03-12 00:43:35,273 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:43:38,051 INFO  L124   PetriNetUnfolderBase]: 6503/26023 cut-off events.
[2024-03-12 00:43:38,052 INFO  L125   PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES.
[2024-03-12 00:43:38,123 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36352 conditions, 26023 events. 6503/26023 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 323912 event pairs, 1207 based on Foata normal form. 0/22666 useless extension candidates. Maximal degree in co-relation 36195. Up to 5287 conditions per place. 
[2024-03-12 00:43:38,190 INFO  L140   encePairwiseOnDemand]: 222/249 looper letters, 70 selfloop transitions, 48 changer transitions 0/336 dead transitions.
[2024-03-12 00:43:38,191 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 336 transitions, 1023 flow
[2024-03-12 00:43:38,192 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:43:38,192 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:43:38,192 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1351 transitions.
[2024-03-12 00:43:38,193 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9042838018741634
[2024-03-12 00:43:38,193 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1351 transitions.
[2024-03-12 00:43:38,193 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1351 transitions.
[2024-03-12 00:43:38,193 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:43:38,193 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1351 transitions.
[2024-03-12 00:43:38,194 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 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-03-12 00:43:38,195 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 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-03-12 00:43:38,195 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 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-03-12 00:43:38,195 INFO  L175             Difference]: Start difference. First operand has 247 places, 258 transitions, 620 flow. Second operand 6 states and 1351 transitions.
[2024-03-12 00:43:38,195 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 336 transitions, 1023 flow
[2024-03-12 00:43:38,198 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 336 transitions, 1021 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:43:38,200 INFO  L231             Difference]: Finished difference. Result has 256 places, 306 transitions, 960 flow
[2024-03-12 00:43:38,201 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=960, PETRI_PLACES=256, PETRI_TRANSITIONS=306}
[2024-03-12 00:43:38,201 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 17 predicate places.
[2024-03-12 00:43:38,201 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 306 transitions, 960 flow
[2024-03-12 00:43:38,201 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 206.16666666666666) internal successors, (1237), 6 states have internal predecessors, (1237), 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-03-12 00:43:38,201 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:43:38,201 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-03-12 00:43:38,201 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-03-12 00:43:38,202 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:43:38,202 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:43:38,202 INFO  L85        PathProgramCache]: Analyzing trace with hash 2041281070, now seen corresponding path program 1 times
[2024-03-12 00:43:38,202 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:43:38,202 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618085728]
[2024-03-12 00:43:38,202 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:38,202 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:43:38,210 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:38,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:38,222 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:43:38,222 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618085728]
[2024-03-12 00:43:38,222 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618085728] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:43:38,222 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:43:38,222 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:43:38,222 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167573643]
[2024-03-12 00:43:38,223 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:43:38,223 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:43:38,223 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:43:38,223 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:43:38,223 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:43:38,240 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-03-12 00:43:38,241 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 306 transitions, 960 flow. Second operand  has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 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-03-12 00:43:38,241 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:43:38,241 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-03-12 00:43:38,241 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:43:38,843 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([601] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][164], [278#(= |#race~datas~0| 0), 72#L1041-8true, Black: 255#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), 29#L1061-6true, Black: 256#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 199#L1041-10true, Black: 248#(= |#race~threads_mask~0| 0)])
[2024-03-12 00:43:38,843 INFO  L294   olderBase$Statistics]: this new event has 153 ancestors and is not cut-off event
[2024-03-12 00:43:38,843 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-12 00:43:38,843 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-12 00:43:38,843 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-12 00:43:40,661 INFO  L124   PetriNetUnfolderBase]: 4821/23949 cut-off events.
[2024-03-12 00:43:40,661 INFO  L125   PetriNetUnfolderBase]: For 1626/1674 co-relation queries the response was YES.
[2024-03-12 00:43:40,759 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35181 conditions, 23949 events. 4821/23949 cut-off events. For 1626/1674 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 306299 event pairs, 1025 based on Foata normal form. 0/21010 useless extension candidates. Maximal degree in co-relation 16682. Up to 2444 conditions per place. 
[2024-03-12 00:43:40,825 INFO  L140   encePairwiseOnDemand]: 243/249 looper letters, 20 selfloop transitions, 3 changer transitions 4/309 dead transitions.
[2024-03-12 00:43:40,826 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 309 transitions, 1017 flow
[2024-03-12 00:43:40,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:43:40,827 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:43:40,827 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions.
[2024-03-12 00:43:40,827 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9384203480589023
[2024-03-12 00:43:40,827 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 701 transitions.
[2024-03-12 00:43:40,827 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 701 transitions.
[2024-03-12 00:43:40,828 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:43:40,828 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 701 transitions.
[2024-03-12 00:43:40,828 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 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-03-12 00:43:40,829 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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-03-12 00:43:40,829 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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-03-12 00:43:40,829 INFO  L175             Difference]: Start difference. First operand has 256 places, 306 transitions, 960 flow. Second operand 3 states and 701 transitions.
[2024-03-12 00:43:40,829 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 309 transitions, 1017 flow
[2024-03-12 00:43:40,844 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 309 transitions, 1017 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:43:40,847 INFO  L231             Difference]: Finished difference. Result has 256 places, 302 transitions, 951 flow
[2024-03-12 00:43:40,847 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=951, PETRI_PLACES=256, PETRI_TRANSITIONS=302}
[2024-03-12 00:43:40,847 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 17 predicate places.
[2024-03-12 00:43:40,847 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 302 transitions, 951 flow
[2024-03-12 00:43:40,848 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 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-03-12 00:43:40,848 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:43:40,848 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, 1, 1, 1, 1]
[2024-03-12 00:43:40,848 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-03-12 00:43:40,848 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:43:40,848 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:43:40,849 INFO  L85        PathProgramCache]: Analyzing trace with hash 1295096415, now seen corresponding path program 1 times
[2024-03-12 00:43:40,849 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:43:40,849 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899842438]
[2024-03-12 00:43:40,849 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:40,849 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:43:40,856 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:40,888 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:40,889 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:43:40,889 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899842438]
[2024-03-12 00:43:40,889 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899842438] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:43:40,889 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:43:40,889 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:43:40,889 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990085424]
[2024-03-12 00:43:40,889 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:43:40,890 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:43:40,890 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:43:40,890 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:43:40,890 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:43:40,959 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-03-12 00:43:40,959 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 302 transitions, 951 flow. Second operand  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 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-03-12 00:43:40,960 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:43:40,960 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-03-12 00:43:40,960 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:43:41,412 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([601] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][157], [281#true, 278#(= |#race~datas~0| 0), 72#L1041-8true, Black: 255#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), 29#L1061-6true, Black: 256#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 199#L1041-10true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0)])
[2024-03-12 00:43:41,412 INFO  L294   olderBase$Statistics]: this new event has 153 ancestors and is not cut-off event
[2024-03-12 00:43:41,412 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-12 00:43:41,412 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-12 00:43:41,412 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-12 00:43:41,424 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([527] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][166], [281#true, 278#(= |#race~datas~0| 0), 72#L1041-8true, Black: 255#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), Black: 256#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 183#L1041-9true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, 27#L1063-6true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0)])
[2024-03-12 00:43:41,424 INFO  L294   olderBase$Statistics]: this new event has 153 ancestors and is not cut-off event
[2024-03-12 00:43:41,424 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-12 00:43:41,424 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-12 00:43:41,424 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-12 00:43:41,453 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([527] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][166], [281#true, 278#(= |#race~datas~0| 0), 72#L1041-8true, Black: 255#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), Black: 256#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, 27#L1063-6true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 199#L1041-10true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0)])
[2024-03-12 00:43:41,454 INFO  L294   olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event
[2024-03-12 00:43:41,454 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:43:41,454 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:43:41,454 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:43:43,571 INFO  L124   PetriNetUnfolderBase]: 5018/24084 cut-off events.
[2024-03-12 00:43:43,572 INFO  L125   PetriNetUnfolderBase]: For 2031/2036 co-relation queries the response was YES.
[2024-03-12 00:43:43,682 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37568 conditions, 24084 events. 5018/24084 cut-off events. For 2031/2036 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 309004 event pairs, 1370 based on Foata normal form. 1/21434 useless extension candidates. Maximal degree in co-relation 35573. Up to 2662 conditions per place. 
[2024-03-12 00:43:43,755 INFO  L140   encePairwiseOnDemand]: 245/249 looper letters, 22 selfloop transitions, 4 changer transitions 0/308 dead transitions.
[2024-03-12 00:43:43,755 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 308 transitions, 1015 flow
[2024-03-12 00:43:43,756 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:43:43,756 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:43:43,757 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 927 transitions.
[2024-03-12 00:43:43,757 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9307228915662651
[2024-03-12 00:43:43,757 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 927 transitions.
[2024-03-12 00:43:43,757 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 927 transitions.
[2024-03-12 00:43:43,757 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:43:43,758 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 927 transitions.
[2024-03-12 00:43:43,758 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 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-03-12 00:43:43,759 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 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-03-12 00:43:43,760 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 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-03-12 00:43:43,760 INFO  L175             Difference]: Start difference. First operand has 256 places, 302 transitions, 951 flow. Second operand 4 states and 927 transitions.
[2024-03-12 00:43:43,760 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 308 transitions, 1015 flow
[2024-03-12 00:43:43,785 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 308 transitions, 1005 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-03-12 00:43:43,788 INFO  L231             Difference]: Finished difference. Result has 255 places, 305 transitions, 966 flow
[2024-03-12 00:43:43,788 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=966, PETRI_PLACES=255, PETRI_TRANSITIONS=305}
[2024-03-12 00:43:43,788 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 16 predicate places.
[2024-03-12 00:43:43,788 INFO  L495      AbstractCegarLoop]: Abstraction has has 255 places, 305 transitions, 966 flow
[2024-03-12 00:43:43,789 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 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-03-12 00:43:43,789 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:43:43,789 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, 1, 1, 1, 1]
[2024-03-12 00:43:43,789 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-03-12 00:43:43,789 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:43:43,789 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:43:43,790 INFO  L85        PathProgramCache]: Analyzing trace with hash -1542162764, now seen corresponding path program 1 times
[2024-03-12 00:43:43,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:43:43,790 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007324834]
[2024-03-12 00:43:43,790 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:43,790 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:43:43,796 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:43,833 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:43,833 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:43:43,834 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007324834]
[2024-03-12 00:43:43,834 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007324834] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:43:43,834 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:43:43,834 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:43:43,834 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983200475]
[2024-03-12 00:43:43,834 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:43:43,834 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:43:43,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:43:43,835 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:43:43,835 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:43:43,918 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-03-12 00:43:43,919 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 305 transitions, 966 flow. Second operand  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 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-03-12 00:43:43,919 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:43:43,919 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-03-12 00:43:43,919 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:43:44,377 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([601] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][156], [278#(= |#race~datas~0| 0), 281#true, 72#L1041-8true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), 29#L1061-6true, 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 199#L1041-10true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:43:44,378 INFO  L294   olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event
[2024-03-12 00:43:44,378 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:43:44,378 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:43:44,378 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:43:44,391 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([527] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][165], [278#(= |#race~datas~0| 0), 281#true, 72#L1041-8true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 183#L1041-9true, Black: 264#true, 27#L1063-6true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:43:44,391 INFO  L294   olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event
[2024-03-12 00:43:44,391 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:43:44,391 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:43:44,391 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:43:44,420 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([527] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][165], [278#(= |#race~datas~0| 0), 281#true, 72#L1041-8true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, 27#L1063-6true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 199#L1041-10true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:43:44,420 INFO  L294   olderBase$Statistics]: this new event has 155 ancestors and is not cut-off event
[2024-03-12 00:43:44,420 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-03-12 00:43:44,420 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-03-12 00:43:44,420 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-03-12 00:43:46,808 INFO  L124   PetriNetUnfolderBase]: 5017/24082 cut-off events.
[2024-03-12 00:43:46,808 INFO  L125   PetriNetUnfolderBase]: For 2159/2164 co-relation queries the response was YES.
[2024-03-12 00:43:46,876 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37638 conditions, 24082 events. 5017/24082 cut-off events. For 2159/2164 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 308993 event pairs, 1370 based on Foata normal form. 1/21377 useless extension candidates. Maximal degree in co-relation 35634. Up to 2662 conditions per place. 
[2024-03-12 00:43:46,926 INFO  L140   encePairwiseOnDemand]: 245/249 looper letters, 21 selfloop transitions, 4 changer transitions 0/307 dead transitions.
[2024-03-12 00:43:46,926 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 307 transitions, 1020 flow
[2024-03-12 00:43:46,927 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:43:46,927 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:43:46,928 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 926 transitions.
[2024-03-12 00:43:46,928 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.929718875502008
[2024-03-12 00:43:46,929 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 926 transitions.
[2024-03-12 00:43:46,929 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 926 transitions.
[2024-03-12 00:43:46,929 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:43:46,929 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 926 transitions.
[2024-03-12 00:43:46,930 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 231.5) internal successors, (926), 4 states have internal predecessors, (926), 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-03-12 00:43:46,931 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 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-03-12 00:43:46,931 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 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-03-12 00:43:46,931 INFO  L175             Difference]: Start difference. First operand has 255 places, 305 transitions, 966 flow. Second operand 4 states and 926 transitions.
[2024-03-12 00:43:46,931 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 307 transitions, 1020 flow
[2024-03-12 00:43:46,951 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 307 transitions, 1020 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:43:46,954 INFO  L231             Difference]: Finished difference. Result has 260 places, 306 transitions, 985 flow
[2024-03-12 00:43:46,954 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=985, PETRI_PLACES=260, PETRI_TRANSITIONS=306}
[2024-03-12 00:43:46,954 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 21 predicate places.
[2024-03-12 00:43:46,954 INFO  L495      AbstractCegarLoop]: Abstraction has has 260 places, 306 transitions, 985 flow
[2024-03-12 00:43:46,955 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 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-03-12 00:43:46,955 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:43:46,955 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, 1, 1, 1, 1, 1]
[2024-03-12 00:43:46,955 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-03-12 00:43:46,955 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:43:46,955 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:43:46,955 INFO  L85        PathProgramCache]: Analyzing trace with hash 1562573418, now seen corresponding path program 1 times
[2024-03-12 00:43:46,956 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:43:46,956 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270031983]
[2024-03-12 00:43:46,956 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:46,956 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:43:46,963 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:46,994 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:46,994 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:43:46,994 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270031983]
[2024-03-12 00:43:46,994 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270031983] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:43:46,994 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:43:46,994 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:43:46,995 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260716040]
[2024-03-12 00:43:46,995 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:43:46,995 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:43:46,995 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:43:46,996 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:43:46,996 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:43:47,061 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-03-12 00:43:47,062 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 306 transitions, 985 flow. Second operand  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 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-03-12 00:43:47,062 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:43:47,062 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-03-12 00:43:47,063 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:43:47,521 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([601] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][157], [278#(= |#race~datas~0| 0), 281#true, 72#L1041-8true, 288#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 29#L1061-6true, 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, 295#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 199#L1041-10true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:43:47,521 INFO  L294   olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event
[2024-03-12 00:43:47,522 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:43:47,522 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:43:47,522 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:43:47,535 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([527] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][166], [278#(= |#race~datas~0| 0), 281#true, 72#L1041-8true, 288#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, 295#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 183#L1041-9true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, 27#L1063-6true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:43:47,535 INFO  L294   olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event
[2024-03-12 00:43:47,536 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:43:47,536 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:43:47,536 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:43:47,567 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([527] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][166], [278#(= |#race~datas~0| 0), 281#true, 72#L1041-8true, 288#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, 295#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, 27#L1063-6true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 199#L1041-10true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:43:47,567 INFO  L294   olderBase$Statistics]: this new event has 155 ancestors and is not cut-off event
[2024-03-12 00:43:47,568 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-03-12 00:43:47,568 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-03-12 00:43:47,568 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-03-12 00:43:49,941 INFO  L124   PetriNetUnfolderBase]: 5028/24109 cut-off events.
[2024-03-12 00:43:49,941 INFO  L125   PetriNetUnfolderBase]: For 2341/2346 co-relation queries the response was YES.
[2024-03-12 00:43:50,033 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37853 conditions, 24109 events. 5028/24109 cut-off events. For 2341/2346 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 309528 event pairs, 1376 based on Foata normal form. 1/21487 useless extension candidates. Maximal degree in co-relation 37734. Up to 2672 conditions per place. 
[2024-03-12 00:43:50,088 INFO  L140   encePairwiseOnDemand]: 245/249 looper letters, 22 selfloop transitions, 4 changer transitions 0/308 dead transitions.
[2024-03-12 00:43:50,089 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 308 transitions, 1041 flow
[2024-03-12 00:43:50,089 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:43:50,089 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:43:50,090 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 927 transitions.
[2024-03-12 00:43:50,090 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9307228915662651
[2024-03-12 00:43:50,090 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 927 transitions.
[2024-03-12 00:43:50,090 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 927 transitions.
[2024-03-12 00:43:50,091 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:43:50,091 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 927 transitions.
[2024-03-12 00:43:50,092 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 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-03-12 00:43:50,092 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 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-03-12 00:43:50,092 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 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-03-12 00:43:50,093 INFO  L175             Difference]: Start difference. First operand has 260 places, 306 transitions, 985 flow. Second operand 4 states and 927 transitions.
[2024-03-12 00:43:50,093 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 308 transitions, 1041 flow
[2024-03-12 00:43:50,115 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 308 transitions, 1038 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:43:50,117 INFO  L231             Difference]: Finished difference. Result has 263 places, 306 transitions, 994 flow
[2024-03-12 00:43:50,118 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=994, PETRI_PLACES=263, PETRI_TRANSITIONS=306}
[2024-03-12 00:43:50,118 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 24 predicate places.
[2024-03-12 00:43:50,118 INFO  L495      AbstractCegarLoop]: Abstraction has has 263 places, 306 transitions, 994 flow
[2024-03-12 00:43:50,118 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 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-03-12 00:43:50,118 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:43:50,119 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, 1, 1, 1, 1, 1]
[2024-03-12 00:43:50,119 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-03-12 00:43:50,119 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:43:50,119 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:43:50,119 INFO  L85        PathProgramCache]: Analyzing trace with hash -493115211, now seen corresponding path program 1 times
[2024-03-12 00:43:50,119 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:43:50,120 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184998025]
[2024-03-12 00:43:50,120 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:50,120 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:43:50,126 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:50,153 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:50,154 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:43:50,154 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184998025]
[2024-03-12 00:43:50,154 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184998025] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:43:50,154 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:43:50,154 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:43:50,154 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797022512]
[2024-03-12 00:43:50,154 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:43:50,155 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:43:50,155 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:43:50,155 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:43:50,155 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:43:50,231 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 224 out of 249
[2024-03-12 00:43:50,232 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 306 transitions, 994 flow. Second operand  has 4 states, 4 states have (on average 225.5) internal successors, (902), 4 states have internal predecessors, (902), 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-03-12 00:43:50,232 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:43:50,232 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 249
[2024-03-12 00:43:50,232 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:43:50,729 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([601] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][156], [281#true, 278#(= |#race~datas~0| 0), 72#L1041-8true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 29#L1061-6true, Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, 295#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 199#L1041-10true, 301#true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:43:50,729 INFO  L294   olderBase$Statistics]: this new event has 158 ancestors and is not cut-off event
[2024-03-12 00:43:50,730 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:43:50,730 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:43:50,730 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:43:50,743 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([527] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][165], [281#true, 278#(= |#race~datas~0| 0), 72#L1041-8true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, 295#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 183#L1041-9true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, 27#L1063-6true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 301#true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:43:50,743 INFO  L294   olderBase$Statistics]: this new event has 158 ancestors and is not cut-off event
[2024-03-12 00:43:50,743 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:43:50,743 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:43:50,743 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:43:50,774 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([527] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][165], [281#true, 278#(= |#race~datas~0| 0), 72#L1041-8true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, 295#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, 27#L1063-6true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 199#L1041-10true, 301#true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:43:50,775 INFO  L294   olderBase$Statistics]: this new event has 159 ancestors and is not cut-off event
[2024-03-12 00:43:50,775 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-03-12 00:43:50,775 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-03-12 00:43:50,775 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-03-12 00:43:53,227 INFO  L124   PetriNetUnfolderBase]: 5134/24297 cut-off events.
[2024-03-12 00:43:53,228 INFO  L125   PetriNetUnfolderBase]: For 2483/2488 co-relation queries the response was YES.
[2024-03-12 00:43:53,306 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38368 conditions, 24297 events. 5134/24297 cut-off events. For 2483/2488 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 312140 event pairs, 1472 based on Foata normal form. 1/21621 useless extension candidates. Maximal degree in co-relation 38248. Up to 2860 conditions per place. 
[2024-03-12 00:43:53,360 INFO  L140   encePairwiseOnDemand]: 245/249 looper letters, 22 selfloop transitions, 4 changer transitions 0/307 dead transitions.
[2024-03-12 00:43:53,361 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 307 transitions, 1048 flow
[2024-03-12 00:43:53,362 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:43:53,362 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:43:53,362 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 923 transitions.
[2024-03-12 00:43:53,363 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9267068273092369
[2024-03-12 00:43:53,363 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 923 transitions.
[2024-03-12 00:43:53,363 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 923 transitions.
[2024-03-12 00:43:53,363 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:43:53,363 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 923 transitions.
[2024-03-12 00:43:53,364 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 230.75) internal successors, (923), 4 states have internal predecessors, (923), 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-03-12 00:43:53,365 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 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-03-12 00:43:53,365 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 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-03-12 00:43:53,365 INFO  L175             Difference]: Start difference. First operand has 263 places, 306 transitions, 994 flow. Second operand 4 states and 923 transitions.
[2024-03-12 00:43:53,365 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 307 transitions, 1048 flow
[2024-03-12 00:43:53,389 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 307 transitions, 1040 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 00:43:53,392 INFO  L231             Difference]: Finished difference. Result has 264 places, 306 transitions, 998 flow
[2024-03-12 00:43:53,392 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=998, PETRI_PLACES=264, PETRI_TRANSITIONS=306}
[2024-03-12 00:43:53,393 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 25 predicate places.
[2024-03-12 00:43:53,393 INFO  L495      AbstractCegarLoop]: Abstraction has has 264 places, 306 transitions, 998 flow
[2024-03-12 00:43:53,393 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 225.5) internal successors, (902), 4 states have internal predecessors, (902), 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-03-12 00:43:53,393 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:43:53,393 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:43:53,393 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-03-12 00:43:53,393 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:43:53,394 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:43:53,394 INFO  L85        PathProgramCache]: Analyzing trace with hash 337626724, now seen corresponding path program 1 times
[2024-03-12 00:43:53,394 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:43:53,394 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645473214]
[2024-03-12 00:43:53,394 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:53,394 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:43:53,403 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:53,417 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:53,417 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:43:53,417 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645473214]
[2024-03-12 00:43:53,417 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645473214] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:43:53,417 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:43:53,418 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:43:53,418 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530543845]
[2024-03-12 00:43:53,418 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:43:53,418 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:43:53,418 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:43:53,419 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:43:53,419 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:43:53,460 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 222 out of 249
[2024-03-12 00:43:53,460 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 306 transitions, 998 flow. Second operand  has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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-03-12 00:43:53,460 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:43:53,461 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 249
[2024-03-12 00:43:53,461 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:43:53,977 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([601] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][154], [281#true, 278#(= |#race~datas~0| 0), 72#L1041-8true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 29#L1061-6true, Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 199#L1041-10true, 309#true, Black: 276#true, 301#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:43:53,977 INFO  L294   olderBase$Statistics]: this new event has 158 ancestors and is not cut-off event
[2024-03-12 00:43:53,977 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:43:53,977 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:43:53,977 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:43:53,989 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([527] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][163], [281#true, 278#(= |#race~datas~0| 0), 72#L1041-8true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 183#L1041-9true, Black: 264#true, 27#L1063-6true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 309#true, Black: 276#true, 301#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:43:53,990 INFO  L294   olderBase$Statistics]: this new event has 158 ancestors and is not cut-off event
[2024-03-12 00:43:53,990 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:43:53,990 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:43:53,990 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:43:54,022 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([527] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][163], [281#true, 278#(= |#race~datas~0| 0), 72#L1041-8true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, 27#L1063-6true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 199#L1041-10true, 309#true, Black: 276#true, 301#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:43:54,023 INFO  L294   olderBase$Statistics]: this new event has 159 ancestors and is not cut-off event
[2024-03-12 00:43:54,023 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-03-12 00:43:54,023 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-03-12 00:43:54,023 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-03-12 00:43:56,470 INFO  L124   PetriNetUnfolderBase]: 5506/25025 cut-off events.
[2024-03-12 00:43:56,470 INFO  L125   PetriNetUnfolderBase]: For 3457/3791 co-relation queries the response was YES.
[2024-03-12 00:43:56,564 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39617 conditions, 25025 events. 5506/25025 cut-off events. For 3457/3791 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 318677 event pairs, 1296 based on Foata normal form. 42/22195 useless extension candidates. Maximal degree in co-relation 39498. Up to 3542 conditions per place. 
[2024-03-12 00:43:56,630 INFO  L140   encePairwiseOnDemand]: 241/249 looper letters, 32 selfloop transitions, 12 changer transitions 0/320 dead transitions.
[2024-03-12 00:43:56,631 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 320 transitions, 1130 flow
[2024-03-12 00:43:56,632 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:43:56,632 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:43:56,632 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions.
[2024-03-12 00:43:56,633 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9370816599732262
[2024-03-12 00:43:56,633 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 700 transitions.
[2024-03-12 00:43:56,633 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 700 transitions.
[2024-03-12 00:43:56,633 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:43:56,633 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 700 transitions.
[2024-03-12 00:43:56,634 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 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-03-12 00:43:56,635 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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-03-12 00:43:56,635 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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-03-12 00:43:56,635 INFO  L175             Difference]: Start difference. First operand has 264 places, 306 transitions, 998 flow. Second operand 3 states and 700 transitions.
[2024-03-12 00:43:56,635 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 320 transitions, 1130 flow
[2024-03-12 00:43:56,655 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 320 transitions, 1122 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 00:43:56,657 INFO  L231             Difference]: Finished difference. Result has 265 places, 316 transitions, 1096 flow
[2024-03-12 00:43:56,658 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1096, PETRI_PLACES=265, PETRI_TRANSITIONS=316}
[2024-03-12 00:43:56,658 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 26 predicate places.
[2024-03-12 00:43:56,658 INFO  L495      AbstractCegarLoop]: Abstraction has has 265 places, 316 transitions, 1096 flow
[2024-03-12 00:43:56,659 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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-03-12 00:43:56,659 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:43:56,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:43:56,659 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-03-12 00:43:56,659 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:43:56,660 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:43:56,660 INFO  L85        PathProgramCache]: Analyzing trace with hash 1957827092, now seen corresponding path program 1 times
[2024-03-12 00:43:56,660 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:43:56,660 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513631776]
[2024-03-12 00:43:56,660 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:56,660 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:43:56,678 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:56,934 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:56,934 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:43:56,934 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513631776]
[2024-03-12 00:43:56,934 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513631776] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:43:56,935 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:43:56,935 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:43:56,935 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51896127]
[2024-03-12 00:43:56,935 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:43:56,936 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:43:56,936 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:43:56,937 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:43:56,937 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:43:57,084 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 204 out of 249
[2024-03-12 00:43:57,085 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 316 transitions, 1096 flow. Second operand  has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 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-03-12 00:43:57,085 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:43:57,085 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 249
[2024-03-12 00:43:57,086 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:44:04,850 INFO  L124   PetriNetUnfolderBase]: 16582/60869 cut-off events.
[2024-03-12 00:44:04,850 INFO  L125   PetriNetUnfolderBase]: For 13822/15308 co-relation queries the response was YES.
[2024-03-12 00:44:05,112 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 106952 conditions, 60869 events. 16582/60869 cut-off events. For 13822/15308 co-relation queries the response was YES. Maximal size of possible extension queue 1657. Compared 847523 event pairs, 4232 based on Foata normal form. 45/53546 useless extension candidates. Maximal degree in co-relation 106671. Up to 14791 conditions per place. 
[2024-03-12 00:44:05,290 INFO  L140   encePairwiseOnDemand]: 222/249 looper letters, 125 selfloop transitions, 136 changer transitions 0/492 dead transitions.
[2024-03-12 00:44:05,290 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 492 transitions, 2362 flow
[2024-03-12 00:44:05,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:44:05,291 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:44:05,292 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1387 transitions.
[2024-03-12 00:44:05,292 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.928380187416332
[2024-03-12 00:44:05,292 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1387 transitions.
[2024-03-12 00:44:05,293 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1387 transitions.
[2024-03-12 00:44:05,293 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:44:05,293 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1387 transitions.
[2024-03-12 00:44:05,294 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 231.16666666666666) internal successors, (1387), 6 states have internal predecessors, (1387), 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-03-12 00:44:05,295 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 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-03-12 00:44:05,295 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 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-03-12 00:44:05,296 INFO  L175             Difference]: Start difference. First operand has 265 places, 316 transitions, 1096 flow. Second operand 6 states and 1387 transitions.
[2024-03-12 00:44:05,296 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 492 transitions, 2362 flow
[2024-03-12 00:44:05,384 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 492 transitions, 2338 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:44:05,388 INFO  L231             Difference]: Finished difference. Result has 272 places, 449 transitions, 2210 flow
[2024-03-12 00:44:05,389 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2210, PETRI_PLACES=272, PETRI_TRANSITIONS=449}
[2024-03-12 00:44:05,389 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 33 predicate places.
[2024-03-12 00:44:05,389 INFO  L495      AbstractCegarLoop]: Abstraction has has 272 places, 449 transitions, 2210 flow
[2024-03-12 00:44:05,389 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 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-03-12 00:44:05,389 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:44:05,390 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:44:05,390 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-03-12 00:44:05,390 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:44:05,390 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:44:05,390 INFO  L85        PathProgramCache]: Analyzing trace with hash 807622693, now seen corresponding path program 1 times
[2024-03-12 00:44:05,390 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:44:05,391 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291583102]
[2024-03-12 00:44:05,391 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:44:05,391 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:44:05,408 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:44:05,627 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:44:05,628 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:44:05,628 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291583102]
[2024-03-12 00:44:05,628 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291583102] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:44:05,628 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:44:05,628 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:44:05,628 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733241280]
[2024-03-12 00:44:05,629 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:44:05,629 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:44:05,629 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:44:05,630 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:44:05,630 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:44:05,844 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 214 out of 249
[2024-03-12 00:44:05,845 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 449 transitions, 2210 flow. Second operand  has 6 states, 6 states have (on average 215.83333333333334) internal successors, (1295), 6 states have internal predecessors, (1295), 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-03-12 00:44:05,845 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:44:05,845 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 249
[2024-03-12 00:44:05,846 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:44:14,973 INFO  L124   PetriNetUnfolderBase]: 16236/68449 cut-off events.
[2024-03-12 00:44:14,974 INFO  L125   PetriNetUnfolderBase]: For 29732/31012 co-relation queries the response was YES.
[2024-03-12 00:44:15,326 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 127436 conditions, 68449 events. 16236/68449 cut-off events. For 29732/31012 co-relation queries the response was YES. Maximal size of possible extension queue 1890. Compared 1019038 event pairs, 2971 based on Foata normal form. 52/60438 useless extension candidates. Maximal degree in co-relation 127144. Up to 12712 conditions per place. 
[2024-03-12 00:44:15,517 INFO  L140   encePairwiseOnDemand]: 234/249 looper letters, 132 selfloop transitions, 119 changer transitions 0/581 dead transitions.
[2024-03-12 00:44:15,517 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 581 transitions, 3612 flow
[2024-03-12 00:44:15,518 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:44:15,518 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:44:15,519 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1371 transitions.
[2024-03-12 00:44:15,519 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9176706827309237
[2024-03-12 00:44:15,519 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1371 transitions.
[2024-03-12 00:44:15,519 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1371 transitions.
[2024-03-12 00:44:15,520 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:44:15,520 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1371 transitions.
[2024-03-12 00:44:15,521 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 228.5) internal successors, (1371), 6 states have internal predecessors, (1371), 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-03-12 00:44:15,522 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 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-03-12 00:44:15,522 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 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-03-12 00:44:15,522 INFO  L175             Difference]: Start difference. First operand has 272 places, 449 transitions, 2210 flow. Second operand 6 states and 1371 transitions.
[2024-03-12 00:44:15,522 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 581 transitions, 3612 flow
[2024-03-12 00:44:15,625 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 581 transitions, 3558 flow, removed 27 selfloop flow, removed 0 redundant places.
[2024-03-12 00:44:15,630 INFO  L231             Difference]: Finished difference. Result has 282 places, 563 transitions, 3576 flow
[2024-03-12 00:44:15,631 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=2156, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3576, PETRI_PLACES=282, PETRI_TRANSITIONS=563}
[2024-03-12 00:44:15,631 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 43 predicate places.
[2024-03-12 00:44:15,631 INFO  L495      AbstractCegarLoop]: Abstraction has has 282 places, 563 transitions, 3576 flow
[2024-03-12 00:44:15,631 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 215.83333333333334) internal successors, (1295), 6 states have internal predecessors, (1295), 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-03-12 00:44:15,631 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:44:15,632 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:44:15,632 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-03-12 00:44:15,632 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:44:15,632 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:44:15,632 INFO  L85        PathProgramCache]: Analyzing trace with hash -120555844, now seen corresponding path program 1 times
[2024-03-12 00:44:15,632 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:44:15,633 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813985694]
[2024-03-12 00:44:15,633 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:44:15,633 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:44:15,648 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:44:16,027 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:44:16,027 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:44:16,028 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813985694]
[2024-03-12 00:44:16,028 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813985694] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:44:16,028 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:44:16,028 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-03-12 00:44:16,028 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509389783]
[2024-03-12 00:44:16,028 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:44:16,029 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-12 00:44:16,029 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:44:16,029 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-12 00:44:16,029 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-12 00:44:16,590 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 198 out of 249
[2024-03-12 00:44:16,591 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 563 transitions, 3576 flow. Second operand  has 10 states, 10 states have (on average 200.1) internal successors, (2001), 10 states have internal predecessors, (2001), 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-03-12 00:44:16,591 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:44:16,592 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 249
[2024-03-12 00:44:16,592 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:44:28,679 INFO  L124   PetriNetUnfolderBase]: 23340/78289 cut-off events.
[2024-03-12 00:44:28,679 INFO  L125   PetriNetUnfolderBase]: For 59242/64882 co-relation queries the response was YES.
[2024-03-12 00:44:29,162 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 181974 conditions, 78289 events. 23340/78289 cut-off events. For 59242/64882 co-relation queries the response was YES. Maximal size of possible extension queue 2162. Compared 1101721 event pairs, 5216 based on Foata normal form. 849/70923 useless extension candidates. Maximal degree in co-relation 181690. Up to 14933 conditions per place. 
[2024-03-12 00:44:29,414 INFO  L140   encePairwiseOnDemand]: 229/249 looper letters, 424 selfloop transitions, 224 changer transitions 0/874 dead transitions.
[2024-03-12 00:44:29,414 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 874 transitions, 7068 flow
[2024-03-12 00:44:29,415 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-12 00:44:29,415 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-12 00:44:29,416 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2378 transitions.
[2024-03-12 00:44:29,417 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8682000730193501
[2024-03-12 00:44:29,417 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 2378 transitions.
[2024-03-12 00:44:29,417 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 2378 transitions.
[2024-03-12 00:44:29,417 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:44:29,417 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2378 transitions.
[2024-03-12 00:44:29,419 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 216.1818181818182) internal successors, (2378), 11 states have internal predecessors, (2378), 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-03-12 00:44:29,420 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 249.0) internal successors, (2988), 12 states have internal predecessors, (2988), 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-03-12 00:44:29,420 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 249.0) internal successors, (2988), 12 states have internal predecessors, (2988), 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-03-12 00:44:29,421 INFO  L175             Difference]: Start difference. First operand has 282 places, 563 transitions, 3576 flow. Second operand 11 states and 2378 transitions.
[2024-03-12 00:44:29,421 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 874 transitions, 7068 flow
[2024-03-12 00:44:30,044 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 874 transitions, 7020 flow, removed 24 selfloop flow, removed 0 redundant places.
[2024-03-12 00:44:30,052 INFO  L231             Difference]: Finished difference. Result has 299 places, 689 transitions, 5536 flow
[2024-03-12 00:44:30,052 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=3528, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5536, PETRI_PLACES=299, PETRI_TRANSITIONS=689}
[2024-03-12 00:44:30,053 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 60 predicate places.
[2024-03-12 00:44:30,053 INFO  L495      AbstractCegarLoop]: Abstraction has has 299 places, 689 transitions, 5536 flow
[2024-03-12 00:44:30,053 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 200.1) internal successors, (2001), 10 states have internal predecessors, (2001), 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-03-12 00:44:30,053 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:44:30,053 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:44:30,053 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-03-12 00:44:30,054 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:44:30,054 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:44:30,054 INFO  L85        PathProgramCache]: Analyzing trace with hash -1053655554, now seen corresponding path program 1 times
[2024-03-12 00:44:30,054 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:44:30,054 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275517954]
[2024-03-12 00:44:30,054 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:44:30,055 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:44:30,069 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:44:30,318 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:44:30,318 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:44:30,318 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275517954]
[2024-03-12 00:44:30,318 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275517954] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:44:30,319 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:44:30,319 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-03-12 00:44:30,319 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788558916]
[2024-03-12 00:44:30,319 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:44:30,319 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-12 00:44:30,319 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:44:30,320 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-12 00:44:30,320 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-12 00:44:30,919 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 201 out of 249
[2024-03-12 00:44:30,922 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 689 transitions, 5536 flow. Second operand  has 10 states, 10 states have (on average 203.0) internal successors, (2030), 10 states have internal predecessors, (2030), 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-03-12 00:44:30,922 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:44:30,922 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 249
[2024-03-12 00:44:30,922 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:44:42,753 INFO  L124   PetriNetUnfolderBase]: 19999/74649 cut-off events.
[2024-03-12 00:44:42,753 INFO  L125   PetriNetUnfolderBase]: For 103051/106678 co-relation queries the response was YES.
[2024-03-12 00:44:43,233 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 185107 conditions, 74649 events. 19999/74649 cut-off events. For 103051/106678 co-relation queries the response was YES. Maximal size of possible extension queue 2167. Compared 1092262 event pairs, 4708 based on Foata normal form. 1033/67505 useless extension candidates. Maximal degree in co-relation 184813. Up to 20563 conditions per place. 
[2024-03-12 00:44:43,475 INFO  L140   encePairwiseOnDemand]: 237/249 looper letters, 404 selfloop transitions, 18 changer transitions 0/702 dead transitions.
[2024-03-12 00:44:43,475 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 702 transitions, 6478 flow
[2024-03-12 00:44:43,476 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 00:44:43,476 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 00:44:43,477 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2072 transitions.
[2024-03-12 00:44:43,477 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8321285140562249
[2024-03-12 00:44:43,477 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 2072 transitions.
[2024-03-12 00:44:43,477 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 2072 transitions.
[2024-03-12 00:44:43,478 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:44:43,478 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2072 transitions.
[2024-03-12 00:44:43,479 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 207.2) internal successors, (2072), 10 states have internal predecessors, (2072), 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-03-12 00:44:43,481 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 249.0) internal successors, (2739), 11 states have internal predecessors, (2739), 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-03-12 00:44:43,481 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 249.0) internal successors, (2739), 11 states have internal predecessors, (2739), 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-03-12 00:44:43,481 INFO  L175             Difference]: Start difference. First operand has 299 places, 689 transitions, 5536 flow. Second operand 10 states and 2072 transitions.
[2024-03-12 00:44:43,481 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 702 transitions, 6478 flow
[2024-03-12 00:44:44,281 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 702 transitions, 6434 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-03-12 00:44:44,288 INFO  L231             Difference]: Finished difference. Result has 306 places, 690 transitions, 5564 flow
[2024-03-12 00:44:44,289 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=5480, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5564, PETRI_PLACES=306, PETRI_TRANSITIONS=690}
[2024-03-12 00:44:44,289 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 67 predicate places.
[2024-03-12 00:44:44,289 INFO  L495      AbstractCegarLoop]: Abstraction has has 306 places, 690 transitions, 5564 flow
[2024-03-12 00:44:44,290 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 203.0) internal successors, (2030), 10 states have internal predecessors, (2030), 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-03-12 00:44:44,290 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:44:44,290 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:44:44,290 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-03-12 00:44:44,290 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:44:44,291 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:44:44,291 INFO  L85        PathProgramCache]: Analyzing trace with hash 1230779042, now seen corresponding path program 1 times
[2024-03-12 00:44:44,291 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:44:44,291 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268077486]
[2024-03-12 00:44:44,291 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:44:44,291 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:44:44,305 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:44:44,322 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:44:44,322 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:44:44,322 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268077486]
[2024-03-12 00:44:44,323 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268077486] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:44:44,323 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:44:44,323 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:44:44,323 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806804286]
[2024-03-12 00:44:44,323 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:44:44,324 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:44:44,324 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:44:44,324 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:44:44,324 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:44:44,359 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 224 out of 249
[2024-03-12 00:44:44,359 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 690 transitions, 5564 flow. Second operand  has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 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-03-12 00:44:44,360 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:44:44,360 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 249
[2024-03-12 00:44:44,360 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:44:47,736 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1042-->L1042-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1)))))  InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|}  OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|}  AuxVars[]  AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][410], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), 166#L1063-2true, 91#L1043-1true, Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 315#true, Black: 276#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 264#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, 326#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 399#true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 338#true, 215#L1042-3true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread1of2ForFork0InUse, Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 246#true])
[2024-03-12 00:44:47,737 INFO  L294   olderBase$Statistics]: this new event has 167 ancestors and is cut-off event
[2024-03-12 00:44:47,737 INFO  L297   olderBase$Statistics]:   existing Event has 167 ancestors and is cut-off event
[2024-03-12 00:44:47,737 INFO  L297   olderBase$Statistics]:   existing Event has 167 ancestors and is cut-off event
[2024-03-12 00:44:47,737 INFO  L297   olderBase$Statistics]:   existing Event has 167 ancestors and is cut-off event
[2024-03-12 00:44:49,539 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1042-->L1042-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1)))))  InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|}  OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|}  AuxVars[]  AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][410], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), 166#L1063-2true, Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 276#true, 315#true, 264#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, 326#true, 235#L1043-19true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 399#true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), 215#L1042-3true, Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), threadThread1of2ForFork0InUse, Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 246#true])
[2024-03-12 00:44:49,539 INFO  L294   olderBase$Statistics]: this new event has 174 ancestors and is cut-off event
[2024-03-12 00:44:49,539 INFO  L297   olderBase$Statistics]:   existing Event has 174 ancestors and is cut-off event
[2024-03-12 00:44:49,539 INFO  L297   olderBase$Statistics]:   existing Event has 174 ancestors and is cut-off event
[2024-03-12 00:44:49,540 INFO  L297   olderBase$Statistics]:   existing Event has 174 ancestors and is cut-off event
[2024-03-12 00:44:49,779 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1042-->L1042-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1)))))  InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|}  OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|}  AuxVars[]  AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][614], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), 166#L1063-2true, Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 315#true, Black: 276#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 264#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, 326#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), 215#L1042-3true, Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), threadThread1of2ForFork0InUse, 10#L1043-20true, Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 401#(= |threadThread1of2ForFork0_#t~nondet8| |#race~threads_mask~0|)])
[2024-03-12 00:44:49,779 INFO  L294   olderBase$Statistics]: this new event has 175 ancestors and is cut-off event
[2024-03-12 00:44:49,779 INFO  L297   olderBase$Statistics]:   existing Event has 175 ancestors and is cut-off event
[2024-03-12 00:44:49,779 INFO  L297   olderBase$Statistics]:   existing Event has 175 ancestors and is cut-off event
[2024-03-12 00:44:49,779 INFO  L297   olderBase$Statistics]:   existing Event has 175 ancestors and is cut-off event
[2024-03-12 00:44:50,052 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1042-->L1042-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1)))))  InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|}  OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|}  AuxVars[]  AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][614], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), 166#L1063-2true, Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 315#true, Black: 276#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 196#L1043-21true, 264#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, 326#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), 215#L1042-3true, Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), threadThread1of2ForFork0InUse, Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 401#(= |threadThread1of2ForFork0_#t~nondet8| |#race~threads_mask~0|)])
[2024-03-12 00:44:50,052 INFO  L294   olderBase$Statistics]: this new event has 176 ancestors and is cut-off event
[2024-03-12 00:44:50,053 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-12 00:44:50,053 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-12 00:44:50,053 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-12 00:44:51,420 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1042-->L1042-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1)))))  InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|}  OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|}  AuxVars[]  AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][410], [60#L1044-3true, 278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), 166#L1063-2true, Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 315#true, Black: 276#true, 264#true, 393#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 326#true, 281#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 399#true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 338#true, 215#L1042-3true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), threadThread1of2ForFork0InUse, Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|)])
[2024-03-12 00:44:51,420 INFO  L294   olderBase$Statistics]: this new event has 180 ancestors and is cut-off event
[2024-03-12 00:44:51,421 INFO  L297   olderBase$Statistics]:   existing Event has 180 ancestors and is cut-off event
[2024-03-12 00:44:51,421 INFO  L297   olderBase$Statistics]:   existing Event has 180 ancestors and is cut-off event
[2024-03-12 00:44:51,421 INFO  L297   olderBase$Statistics]:   existing Event has 180 ancestors and is cut-off event
[2024-03-12 00:44:56,607 INFO  L124   PetriNetUnfolderBase]: 17816/75735 cut-off events.
[2024-03-12 00:44:56,608 INFO  L125   PetriNetUnfolderBase]: For 79446/85745 co-relation queries the response was YES.
[2024-03-12 00:44:57,163 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 167349 conditions, 75735 events. 17816/75735 cut-off events. For 79446/85745 co-relation queries the response was YES. Maximal size of possible extension queue 2013. Compared 1149149 event pairs, 2684 based on Foata normal form. 259/67801 useless extension candidates. Maximal degree in co-relation 166963. Up to 9388 conditions per place. 
[2024-03-12 00:44:57,381 INFO  L140   encePairwiseOnDemand]: 240/249 looper letters, 38 selfloop transitions, 19 changer transitions 0/711 dead transitions.
[2024-03-12 00:44:57,382 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 711 transitions, 5772 flow
[2024-03-12 00:44:57,383 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:44:57,383 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:44:57,383 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions.
[2024-03-12 00:44:57,384 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9464524765729585
[2024-03-12 00:44:57,384 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 707 transitions.
[2024-03-12 00:44:57,384 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 707 transitions.
[2024-03-12 00:44:57,384 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:44:57,384 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 707 transitions.
[2024-03-12 00:44:57,385 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 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-03-12 00:44:57,385 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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-03-12 00:44:57,386 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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-03-12 00:44:57,386 INFO  L175             Difference]: Start difference. First operand has 306 places, 690 transitions, 5564 flow. Second operand 3 states and 707 transitions.
[2024-03-12 00:44:57,386 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 711 transitions, 5772 flow
[2024-03-12 00:44:58,014 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 711 transitions, 5736 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-03-12 00:44:58,021 INFO  L231             Difference]: Finished difference. Result has 305 places, 705 transitions, 5710 flow
[2024-03-12 00:44:58,021 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=5528, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5710, PETRI_PLACES=305, PETRI_TRANSITIONS=705}
[2024-03-12 00:44:58,021 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 66 predicate places.
[2024-03-12 00:44:58,022 INFO  L495      AbstractCegarLoop]: Abstraction has has 305 places, 705 transitions, 5710 flow
[2024-03-12 00:44:58,022 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 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-03-12 00:44:58,022 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:44:58,022 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:44:58,022 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-03-12 00:44:58,022 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:44:58,023 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:44:58,023 INFO  L85        PathProgramCache]: Analyzing trace with hash -341571048, now seen corresponding path program 1 times
[2024-03-12 00:44:58,023 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:44:58,023 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550716254]
[2024-03-12 00:44:58,023 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:44:58,023 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:44:58,045 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:44:59,133 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:44:59,134 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:44:59,134 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550716254]
[2024-03-12 00:44:59,134 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550716254] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:44:59,134 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658852008]
[2024-03-12 00:44:59,134 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:44:59,134 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:44:59,135 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:44:59,136 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:44:59,138 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2024-03-12 00:44:59,333 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:44:59,335 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 34 conjunts are in the unsatisfiable core
[2024-03-12 00:44:59,340 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:44:59,373 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-03-12 00:44:59,447 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:44:59,447 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 15 treesize of output 15
[2024-03-12 00:44:59,791 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:44:59,792 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-03-12 00:44:59,838 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:44:59,839 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 26 treesize of output 19
[2024-03-12 00:44:59,902 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13
[2024-03-12 00:44:59,937 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 15 treesize of output 11
[2024-03-12 00:44:59,972 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 28 treesize of output 27
[2024-03-12 00:45:00,016 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:45:00,016 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 40 treesize of output 42
[2024-03-12 00:45:00,067 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:45:00,068 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 52 treesize of output 57
[2024-03-12 00:45:00,129 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 56 treesize of output 45
[2024-03-12 00:45:00,138 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:45:00,138 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:45:00,139 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658852008] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:45:00,139 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:45:00,139 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [20] total 31
[2024-03-12 00:45:00,139 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376511229]
[2024-03-12 00:45:00,139 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:45:00,139 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-03-12 00:45:00,140 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:45:00,140 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-03-12 00:45:00,140 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992
[2024-03-12 00:45:00,888 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 186 out of 249
[2024-03-12 00:45:00,889 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 705 transitions, 5710 flow. Second operand  has 14 states, 14 states have (on average 188.35714285714286) internal successors, (2637), 14 states have internal predecessors, (2637), 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-03-12 00:45:00,889 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:45:00,889 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 249
[2024-03-12 00:45:00,889 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:45:23,242 INFO  L124   PetriNetUnfolderBase]: 36671/117778 cut-off events.
[2024-03-12 00:45:23,242 INFO  L125   PetriNetUnfolderBase]: For 206509/207730 co-relation queries the response was YES.
[2024-03-12 00:45:24,176 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 318431 conditions, 117778 events. 36671/117778 cut-off events. For 206509/207730 co-relation queries the response was YES. Maximal size of possible extension queue 2989. Compared 1716122 event pairs, 6603 based on Foata normal form. 250/107492 useless extension candidates. Maximal degree in co-relation 317656. Up to 14314 conditions per place. 
[2024-03-12 00:45:24,589 INFO  L140   encePairwiseOnDemand]: 225/249 looper letters, 1024 selfloop transitions, 487 changer transitions 0/1736 dead transitions.
[2024-03-12 00:45:24,590 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 1736 transitions, 19539 flow
[2024-03-12 00:45:24,590 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2024-03-12 00:45:24,590 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2024-03-12 00:45:24,592 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3998 transitions.
[2024-03-12 00:45:24,593 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8028112449799196
[2024-03-12 00:45:24,593 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 3998 transitions.
[2024-03-12 00:45:24,593 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 3998 transitions.
[2024-03-12 00:45:24,593 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:45:24,593 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3998 transitions.
[2024-03-12 00:45:24,596 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 199.9) internal successors, (3998), 20 states have internal predecessors, (3998), 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-03-12 00:45:24,598 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 249.0) internal successors, (5229), 21 states have internal predecessors, (5229), 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-03-12 00:45:24,599 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 249.0) internal successors, (5229), 21 states have internal predecessors, (5229), 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-03-12 00:45:24,599 INFO  L175             Difference]: Start difference. First operand has 305 places, 705 transitions, 5710 flow. Second operand 20 states and 3998 transitions.
[2024-03-12 00:45:24,599 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 1736 transitions, 19539 flow
[2024-03-12 00:45:26,650 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 1736 transitions, 19501 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:45:26,664 INFO  L231             Difference]: Finished difference. Result has 332 places, 1116 transitions, 12628 flow
[2024-03-12 00:45:26,665 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=5672, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=12628, PETRI_PLACES=332, PETRI_TRANSITIONS=1116}
[2024-03-12 00:45:26,665 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 93 predicate places.
[2024-03-12 00:45:26,665 INFO  L495      AbstractCegarLoop]: Abstraction has has 332 places, 1116 transitions, 12628 flow
[2024-03-12 00:45:26,666 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 188.35714285714286) internal successors, (2637), 14 states have internal predecessors, (2637), 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-03-12 00:45:26,666 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:45:26,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:45:26,676 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2024-03-12 00:45:26,866 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,12 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:45:26,867 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:45:26,868 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:45:26,868 INFO  L85        PathProgramCache]: Analyzing trace with hash -1494089320, now seen corresponding path program 2 times
[2024-03-12 00:45:26,868 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:45:26,868 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364036154]
[2024-03-12 00:45:26,869 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:45:26,869 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:45:26,890 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:45:27,541 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:45:27,541 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:45:27,541 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364036154]
[2024-03-12 00:45:27,542 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364036154] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:45:27,542 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928309091]
[2024-03-12 00:45:27,542 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-12 00:45:27,542 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:45:27,542 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:45:27,543 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:45:27,545 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2024-03-12 00:45:27,737 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-12 00:45:27,738 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:45:27,739 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 38 conjunts are in the unsatisfiable core
[2024-03-12 00:45:27,744 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:45:27,774 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-03-12 00:45:27,849 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:45:27,850 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 15 treesize of output 15
[2024-03-12 00:45:28,209 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:45:28,209 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-03-12 00:45:28,257 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:45:28,257 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 26 treesize of output 19
[2024-03-12 00:45:28,277 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 15 treesize of output 11
[2024-03-12 00:45:28,314 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 28 treesize of output 27
[2024-03-12 00:45:28,365 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:45:28,365 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 40 treesize of output 42
[2024-03-12 00:45:28,424 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:45:28,424 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 52 treesize of output 57
[2024-03-12 00:45:28,703 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13
[2024-03-12 00:45:28,763 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:45:28,764 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 56 treesize of output 45
[2024-03-12 00:45:28,785 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:45:28,786 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 56 treesize of output 45
[2024-03-12 00:45:28,811 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:45:28,812 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 56 treesize of output 45
[2024-03-12 00:45:28,828 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:45:28,828 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 56 treesize of output 45
[2024-03-12 00:45:28,870 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 56 treesize of output 45
[2024-03-12 00:45:28,880 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:45:28,880 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:45:28,881 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928309091] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:45:28,881 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:45:28,881 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-03-12 00:45:28,881 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386747496]
[2024-03-12 00:45:28,881 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:45:28,881 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-12 00:45:28,882 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:45:28,882 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-12 00:45:28,882 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702
[2024-03-12 00:45:30,222 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 186 out of 249
[2024-03-12 00:45:30,224 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 1116 transitions, 12628 flow. Second operand  has 15 states, 15 states have (on average 188.2) internal successors, (2823), 15 states have internal predecessors, (2823), 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-03-12 00:45:30,224 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:45:30,224 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 249
[2024-03-12 00:45:30,224 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:45:58,636 INFO  L124   PetriNetUnfolderBase]: 37407/118602 cut-off events.
[2024-03-12 00:45:58,636 INFO  L125   PetriNetUnfolderBase]: For 349869/354563 co-relation queries the response was YES.
[2024-03-12 00:45:59,754 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 357241 conditions, 118602 events. 37407/118602 cut-off events. For 349869/354563 co-relation queries the response was YES. Maximal size of possible extension queue 3106. Compared 1727076 event pairs, 5711 based on Foata normal form. 520/108083 useless extension candidates. Maximal degree in co-relation 356623. Up to 18633 conditions per place. 
[2024-03-12 00:46:00,320 INFO  L140   encePairwiseOnDemand]: 221/249 looper letters, 825 selfloop transitions, 806 changer transitions 0/1856 dead transitions.
[2024-03-12 00:46:00,320 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 1856 transitions, 24287 flow
[2024-03-12 00:46:00,321 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2024-03-12 00:46:00,321 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2024-03-12 00:46:00,322 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 5046 transitions.
[2024-03-12 00:46:00,324 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8106024096385542
[2024-03-12 00:46:00,324 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 5046 transitions.
[2024-03-12 00:46:00,324 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 5046 transitions.
[2024-03-12 00:46:00,324 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:46:00,324 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 5046 transitions.
[2024-03-12 00:46:00,328 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 201.84) internal successors, (5046), 25 states have internal predecessors, (5046), 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-03-12 00:46:00,331 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 249.0) internal successors, (6474), 26 states have internal predecessors, (6474), 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-03-12 00:46:00,331 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 249.0) internal successors, (6474), 26 states have internal predecessors, (6474), 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-03-12 00:46:00,331 INFO  L175             Difference]: Start difference. First operand has 332 places, 1116 transitions, 12628 flow. Second operand 25 states and 5046 transitions.
[2024-03-12 00:46:00,332 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 1856 transitions, 24287 flow
[2024-03-12 00:46:04,645 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 1856 transitions, 24157 flow, removed 59 selfloop flow, removed 6 redundant places.
[2024-03-12 00:46:04,666 INFO  L231             Difference]: Finished difference. Result has 359 places, 1449 transitions, 20376 flow
[2024-03-12 00:46:04,667 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=12504, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=484, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=20376, PETRI_PLACES=359, PETRI_TRANSITIONS=1449}
[2024-03-12 00:46:04,667 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 120 predicate places.
[2024-03-12 00:46:04,667 INFO  L495      AbstractCegarLoop]: Abstraction has has 359 places, 1449 transitions, 20376 flow
[2024-03-12 00:46:04,668 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 188.2) internal successors, (2823), 15 states have internal predecessors, (2823), 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-03-12 00:46:04,668 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:46:04,668 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:46:04,675 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2024-03-12 00:46:04,869 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43
[2024-03-12 00:46:04,869 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:46:04,870 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:46:04,870 INFO  L85        PathProgramCache]: Analyzing trace with hash -1416884328, now seen corresponding path program 3 times
[2024-03-12 00:46:04,870 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:46:04,870 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930177736]
[2024-03-12 00:46:04,870 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:46:04,870 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:46:04,896 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:46:05,594 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:46:05,595 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:46:05,595 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930177736]
[2024-03-12 00:46:05,595 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930177736] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:46:05,595 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17979620]
[2024-03-12 00:46:05,595 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-12 00:46:05,596 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:46:05,596 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:46:05,597 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:46:05,598 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2024-03-12 00:46:05,817 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-12 00:46:05,817 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:46:05,820 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 40 conjunts are in the unsatisfiable core
[2024-03-12 00:46:05,826 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:46:05,857 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-03-12 00:46:05,925 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:46:05,925 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 15 treesize of output 15
[2024-03-12 00:46:06,250 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:46:06,250 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-03-12 00:46:06,299 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:46:06,300 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 26 treesize of output 19
[2024-03-12 00:46:06,324 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 15 treesize of output 11
[2024-03-12 00:46:06,369 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 28 treesize of output 27
[2024-03-12 00:46:06,419 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:46:06,420 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 40 treesize of output 42
[2024-03-12 00:46:06,598 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13
[2024-03-12 00:46:06,655 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:46:06,656 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 52 treesize of output 57
[2024-03-12 00:46:06,718 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:46:06,718 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 56 treesize of output 45
[2024-03-12 00:46:06,744 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:46:06,745 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 56 treesize of output 45
[2024-03-12 00:46:06,768 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:46:06,769 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 56 treesize of output 45
[2024-03-12 00:46:06,792 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:46:06,793 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 56 treesize of output 45
[2024-03-12 00:46:06,828 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 56 treesize of output 45
[2024-03-12 00:46:06,838 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:46:06,839 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:46:06,839 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [17979620] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:46:06,839 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:46:06,839 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-03-12 00:46:06,839 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139018289]
[2024-03-12 00:46:06,839 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:46:06,840 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-12 00:46:06,840 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:46:06,840 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-12 00:46:06,841 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702
[2024-03-12 00:46:07,881 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 186 out of 249
[2024-03-12 00:46:07,882 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 1449 transitions, 20376 flow. Second operand  has 15 states, 15 states have (on average 188.2) internal successors, (2823), 15 states have internal predecessors, (2823), 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-03-12 00:46:07,882 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:46:07,882 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 249
[2024-03-12 00:46:07,882 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:46:39,971 INFO  L124   PetriNetUnfolderBase]: 39439/120501 cut-off events.
[2024-03-12 00:46:39,972 INFO  L125   PetriNetUnfolderBase]: For 572321/576646 co-relation queries the response was YES.
[2024-03-12 00:46:41,213 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 408461 conditions, 120501 events. 39439/120501 cut-off events. For 572321/576646 co-relation queries the response was YES. Maximal size of possible extension queue 3228. Compared 1735542 event pairs, 6653 based on Foata normal form. 1000/109839 useless extension candidates. Maximal degree in co-relation 408050. Up to 19435 conditions per place. 
[2024-03-12 00:46:41,690 INFO  L140   encePairwiseOnDemand]: 221/249 looper letters, 865 selfloop transitions, 1050 changer transitions 54/2194 dead transitions.
[2024-03-12 00:46:41,690 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 2194 transitions, 33316 flow
[2024-03-12 00:46:41,691 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2024-03-12 00:46:41,691 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2024-03-12 00:46:41,692 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 5253 transitions.
[2024-03-12 00:46:41,695 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8113994439295644
[2024-03-12 00:46:41,695 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 5253 transitions.
[2024-03-12 00:46:41,695 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 5253 transitions.
[2024-03-12 00:46:41,696 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:46:41,696 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 5253 transitions.
[2024-03-12 00:46:41,700 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 202.03846153846155) internal successors, (5253), 26 states have internal predecessors, (5253), 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-03-12 00:46:41,703 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 249.0) internal successors, (6723), 27 states have internal predecessors, (6723), 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-03-12 00:46:41,703 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 249.0) internal successors, (6723), 27 states have internal predecessors, (6723), 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-03-12 00:46:41,703 INFO  L175             Difference]: Start difference. First operand has 359 places, 1449 transitions, 20376 flow. Second operand 26 states and 5253 transitions.
[2024-03-12 00:46:41,703 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 2194 transitions, 33316 flow
[2024-03-12 00:46:49,776 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 2194 transitions, 32510 flow, removed 397 selfloop flow, removed 6 redundant places.
[2024-03-12 00:46:49,800 INFO  L231             Difference]: Finished difference. Result has 389 places, 1703 transitions, 27966 flow
[2024-03-12 00:46:49,801 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=19634, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=785, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=27966, PETRI_PLACES=389, PETRI_TRANSITIONS=1703}
[2024-03-12 00:46:49,802 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 150 predicate places.
[2024-03-12 00:46:49,802 INFO  L495      AbstractCegarLoop]: Abstraction has has 389 places, 1703 transitions, 27966 flow
[2024-03-12 00:46:49,802 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 188.2) internal successors, (2823), 15 states have internal predecessors, (2823), 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-03-12 00:46:49,802 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:46:49,802 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:46:49,810 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2024-03-12 00:46:50,004 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,14 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:46:50,004 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:46:50,005 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:46:50,005 INFO  L85        PathProgramCache]: Analyzing trace with hash -1551371496, now seen corresponding path program 4 times
[2024-03-12 00:46:50,005 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:46:50,005 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628448064]
[2024-03-12 00:46:50,006 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:46:50,006 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:46:50,031 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:46:50,630 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:46:50,630 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:46:50,630 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628448064]
[2024-03-12 00:46:50,630 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628448064] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:46:50,630 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634930371]
[2024-03-12 00:46:50,630 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-12 00:46:50,631 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:46:50,631 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:46:50,632 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:46:50,634 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2024-03-12 00:46:50,924 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-12 00:46:50,924 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:46:50,927 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 58 conjunts are in the unsatisfiable core
[2024-03-12 00:46:50,934 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:46:50,943 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-03-12 00:46:50,970 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:46:50,971 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14
[2024-03-12 00:46:51,041 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:46:51,053 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-03-12 00:46:51,054 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-03-12 00:46:51,646 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:46:51,646 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-03-12 00:46:51,883 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 26 treesize of output 19
[2024-03-12 00:46:51,913 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-03-12 00:46:52,074 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 25 treesize of output 13
[2024-03-12 00:46:52,114 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-03-12 00:46:52,168 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 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-03-12 00:46:52,231 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 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-03-12 00:46:52,293 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 37 treesize of output 26
[2024-03-12 00:46:52,317 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 37 treesize of output 26
[2024-03-12 00:46:52,340 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 37 treesize of output 26
[2024-03-12 00:46:52,359 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 37 treesize of output 26
[2024-03-12 00:46:52,437 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-03-12 00:46:52,476 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:46:52,476 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:46:52,476 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634930371] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:46:52,477 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:46:52,477 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [15] total 32
[2024-03-12 00:46:52,477 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036624994]
[2024-03-12 00:46:52,477 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:46:52,477 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2024-03-12 00:46:52,477 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:46:52,477 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2024-03-12 00:46:52,478 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056
[2024-03-12 00:46:54,443 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 178 out of 249
[2024-03-12 00:46:54,444 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 1703 transitions, 27966 flow. Second operand  has 19 states, 19 states have (on average 179.94736842105263) internal successors, (3419), 19 states have internal predecessors, (3419), 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-03-12 00:46:54,444 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:46:54,444 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 249
[2024-03-12 00:46:54,444 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:48:33,449 INFO  L124   PetriNetUnfolderBase]: 112376/332940 cut-off events.
[2024-03-12 00:48:33,449 INFO  L125   PetriNetUnfolderBase]: For 2061489/2067952 co-relation queries the response was YES.
[2024-03-12 00:48:37,687 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1190426 conditions, 332940 events. 112376/332940 cut-off events. For 2061489/2067952 co-relation queries the response was YES. Maximal size of possible extension queue 8595. Compared 5344765 event pairs, 22915 based on Foata normal form. 1157/300417 useless extension candidates. Maximal degree in co-relation 1171774. Up to 58534 conditions per place. 
[2024-03-12 00:48:39,341 INFO  L140   encePairwiseOnDemand]: 210/249 looper letters, 3259 selfloop transitions, 1330 changer transitions 4/4810 dead transitions.
[2024-03-12 00:48:39,341 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 4810 transitions, 87526 flow
[2024-03-12 00:48:39,342 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2024-03-12 00:48:39,342 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2024-03-12 00:48:39,344 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 7245 transitions.
[2024-03-12 00:48:39,345 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7863887984369912
[2024-03-12 00:48:39,346 INFO  L72            ComplementDD]: Start complementDD. Operand 37 states and 7245 transitions.
[2024-03-12 00:48:39,346 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 37 states and 7245 transitions.
[2024-03-12 00:48:39,347 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:48:39,347 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 7245 transitions.
[2024-03-12 00:48:39,351 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 38 states, 37 states have (on average 195.8108108108108) internal successors, (7245), 37 states have internal predecessors, (7245), 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-03-12 00:48:39,355 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 38 states, 38 states have (on average 249.0) internal successors, (9462), 38 states have internal predecessors, (9462), 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-03-12 00:48:39,355 INFO  L81            ComplementDD]: Finished complementDD. Result  has 38 states, 38 states have (on average 249.0) internal successors, (9462), 38 states have internal predecessors, (9462), 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-03-12 00:48:39,355 INFO  L175             Difference]: Start difference. First operand has 389 places, 1703 transitions, 27966 flow. Second operand 37 states and 7245 transitions.
[2024-03-12 00:48:39,355 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 4810 transitions, 87526 flow
[2024-03-12 00:49:55,341 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 4810 transitions, 84858 flow, removed 164 selfloop flow, removed 22 redundant places.
[2024-03-12 00:49:55,394 INFO  L231             Difference]: Finished difference. Result has 428 places, 3027 transitions, 59139 flow
[2024-03-12 00:49:55,395 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=26909, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=236, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=783, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=59139, PETRI_PLACES=428, PETRI_TRANSITIONS=3027}
[2024-03-12 00:49:55,395 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 189 predicate places.
[2024-03-12 00:49:55,395 INFO  L495      AbstractCegarLoop]: Abstraction has has 428 places, 3027 transitions, 59139 flow
[2024-03-12 00:49:55,396 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 19 states have (on average 179.94736842105263) internal successors, (3419), 19 states have internal predecessors, (3419), 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-03-12 00:49:55,396 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:49:55,396 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-12 00:49:55,403 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0
[2024-03-12 00:49:55,596 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45
[2024-03-12 00:49:55,597 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:49:55,597 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:49:55,598 INFO  L85        PathProgramCache]: Analyzing trace with hash 776068064, now seen corresponding path program 1 times
[2024-03-12 00:49:55,598 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:49:55,598 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768498187]
[2024-03-12 00:49:55,598 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:49:55,598 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:49:55,621 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:49:56,135 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:49:56,136 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:49:56,136 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768498187]
[2024-03-12 00:49:56,136 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768498187] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:49:56,136 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051907664]
[2024-03-12 00:49:56,136 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:49:56,136 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:49:56,136 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:49:56,137 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:49:56,139 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2024-03-12 00:49:56,337 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:49:56,338 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 30 conjunts are in the unsatisfiable core
[2024-03-12 00:49:56,342 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:49:56,372 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-03-12 00:49:56,430 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:49:56,431 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 15 treesize of output 15
[2024-03-12 00:49:56,770 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:49:56,770 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-03-12 00:49:56,827 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:49:56,827 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 26 treesize of output 19
[2024-03-12 00:49:56,890 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 13
[2024-03-12 00:49:56,901 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 15 treesize of output 11
[2024-03-12 00:49:56,908 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 28 treesize of output 27
[2024-03-12 00:49:56,918 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:49:56,918 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 40 treesize of output 42
[2024-03-12 00:49:56,934 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:49:56,934 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 52 treesize of output 57
[2024-03-12 00:49:56,949 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 56 treesize of output 45
[2024-03-12 00:49:56,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:49:56,963 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:49:56,963 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051907664] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:49:56,963 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:49:56,963 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 21
[2024-03-12 00:49:56,964 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850829702]
[2024-03-12 00:49:56,964 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:49:56,964 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-03-12 00:49:56,964 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:49:56,965 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-03-12 00:49:56,965 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462
[2024-03-12 00:49:58,093 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 198 out of 249
[2024-03-12 00:49:58,094 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 3027 transitions, 59139 flow. Second operand  has 14 states, 14 states have (on average 199.71428571428572) internal successors, (2796), 14 states have internal predecessors, (2796), 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-03-12 00:49:58,094 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:49:58,094 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 249
[2024-03-12 00:49:58,094 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:51:03,031 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([777] L1043-->L1043-1: Formula: (= |v_#race~threads_mask~0_1| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_1|}  AuxVars[]  AssignedVars[#race~threads_mask~0][2856], [Black: 1998#(and (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2020#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2046#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1))), Black: 2036#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2014#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2008#(and (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 2044#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2028#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1996#(and (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2018#(and (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1982#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1))), Black: 2016#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1994#(and (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2022#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2024#(and (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2026#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 2012#(and (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 2030#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 2040#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 2006#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2042#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2010#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2038#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2034#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= threadThread1of2ForFork0_~j~0 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), 315#true, Black: 276#true, Black: 2004#(and (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), 58#L1056-21true, Black: 788#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 778#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 790#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 786#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 326#true, Black: 792#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 794#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 425#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 780#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 782#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 774#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 2432#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 1605#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1601#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1595#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1585#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1591#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), 87#L1043-1true, Black: 1603#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1593#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 1597#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 1583#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), 264#true, 1726#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 1575#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 278#(= |#race~datas~0| 0), Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 401#(= |threadThread1of2ForFork0_#t~nondet8| |#race~threads_mask~0|), 1170#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1192#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1200#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1184#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1188#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1180#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1176#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), 281#true, 71#L1043-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 246#true])
[2024-03-12 00:51:03,031 INFO  L294   olderBase$Statistics]: this new event has 182 ancestors and is cut-off event
[2024-03-12 00:51:03,031 INFO  L297   olderBase$Statistics]:   existing Event has 182 ancestors and is cut-off event
[2024-03-12 00:51:03,031 INFO  L297   olderBase$Statistics]:   existing Event has 182 ancestors and is cut-off event
[2024-03-12 00:51:03,031 INFO  L297   olderBase$Statistics]:   existing Event has 182 ancestors and is cut-off event
[2024-03-12 00:51:03,799 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([777] L1043-->L1043-1: Formula: (= |v_#race~threads_mask~0_1| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_1|}  AuxVars[]  AssignedVars[#race~threads_mask~0][2525], [Black: 1998#(and (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2020#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2046#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1))), Black: 2036#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2014#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2008#(and (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 2044#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2028#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1996#(and (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2018#(and (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1982#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1))), Black: 2016#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1994#(and (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2022#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2024#(and (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2026#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 2012#(and (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 2030#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 2040#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 2006#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2042#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2010#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2038#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2034#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= threadThread1of2ForFork0_~j~0 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), 315#true, Black: 276#true, Black: 2004#(and (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 788#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 778#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 790#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 786#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 326#true, Black: 792#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 794#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 425#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 780#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 782#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 774#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 2432#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 1605#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1601#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1595#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1585#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1591#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), 87#L1043-1true, Black: 1603#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1593#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 1597#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 1583#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), 196#L1043-21true, 264#true, 1726#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 1575#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 176#L1056-2true, 278#(= |#race~datas~0| 0), Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 401#(= |threadThread1of2ForFork0_#t~nondet8| |#race~threads_mask~0|), 1170#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1192#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1200#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1184#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1188#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1180#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1176#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), 281#true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 246#true])
[2024-03-12 00:51:03,799 INFO  L294   olderBase$Statistics]: this new event has 182 ancestors and is cut-off event
[2024-03-12 00:51:03,799 INFO  L297   olderBase$Statistics]:   existing Event has 182 ancestors and is cut-off event
[2024-03-12 00:51:03,799 INFO  L297   olderBase$Statistics]:   existing Event has 182 ancestors and is cut-off event
[2024-03-12 00:51:03,799 INFO  L297   olderBase$Statistics]:   existing Event has 182 ancestors and is cut-off event
[2024-03-12 00:51:03,832 INFO  L292   olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([777] L1043-->L1043-1: Formula: (= |v_#race~threads_mask~0_1| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_1|}  AuxVars[]  AssignedVars[#race~threads_mask~0][2525], [Black: 1998#(and (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2020#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2046#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1))), Black: 2036#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2014#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2008#(and (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 2044#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2028#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1996#(and (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2018#(and (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1982#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1))), Black: 2016#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1994#(and (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2022#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2024#(and (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2026#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 2012#(and (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 2030#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 2040#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 2006#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2042#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2010#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2038#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2034#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= threadThread1of2ForFork0_~j~0 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), 315#true, Black: 276#true, Black: 2004#(and (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 788#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 778#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 790#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 786#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 326#true, Black: 792#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 794#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 425#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 780#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 782#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 774#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 2432#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 1605#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1601#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1595#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1585#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), 87#L1043-1true, Black: 1591#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 1603#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1593#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 1597#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 1583#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), 264#true, 196#L1043-21true, 1726#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 1575#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 176#L1056-2true, 278#(= |#race~datas~0| 0), Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 401#(= |threadThread1of2ForFork0_#t~nondet8| |#race~threads_mask~0|), 1170#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1192#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1200#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1184#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1188#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1180#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1176#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), 281#true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, Black: 246#true])
[2024-03-12 00:51:03,833 INFO  L294   olderBase$Statistics]: this new event has 182 ancestors and is cut-off event
[2024-03-12 00:51:03,833 INFO  L297   olderBase$Statistics]:   existing Event has 182 ancestors and is cut-off event
[2024-03-12 00:51:03,833 INFO  L297   olderBase$Statistics]:   existing Event has 182 ancestors and is cut-off event
[2024-03-12 00:51:03,833 INFO  L297   olderBase$Statistics]:   existing Event has 182 ancestors and is cut-off event
[2024-03-12 00:51:03,833 INFO  L297   olderBase$Statistics]:   existing Event has 182 ancestors and is cut-off event
[2024-03-12 00:51:03,838 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([610] L1056-->L1056-1: Formula: (= |v_#race~threads_mask~0_10| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_10|}  AuxVars[]  AssignedVars[#race~threads_mask~0][730], [Black: 1998#(and (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2020#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2046#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1))), Black: 2036#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2014#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2008#(and (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 2044#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2028#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1996#(and (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2018#(and (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1982#(and (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1))), Black: 2016#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 1994#(and (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2022#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2024#(and (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2026#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 2012#(and (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 2030#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 2040#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 3)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 2006#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2042#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2010#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2038#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 0)) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 2)) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) 1)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 2034#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= threadThread1of2ForFork0_~j~0 0) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), 315#true, Black: 276#true, Black: 2004#(and (= ~datas~0.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 788#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 778#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 790#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 786#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 326#true, Black: 792#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 794#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 425#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 780#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (= |ULTIMATE.start_main_#t~mem22#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 782#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 774#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 2432#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 320#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 318#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 1605#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1601#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1595#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1585#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1591#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 1603#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1593#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 1597#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 1583#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), 264#true, 196#L1043-21true, 1726#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 338#true, Black: 361#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 347#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 359#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 357#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 1575#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 355#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 278#(= |#race~datas~0| 0), 47#L1056-1true, Black: 391#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 389#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 387#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 401#(= |threadThread1of2ForFork0_#t~nondet8| |#race~threads_mask~0|), 1170#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1192#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ 2 |ULTIMATE.start_main_#t~mem25#1.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base |ULTIMATE.start_main_#t~mem25#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1200#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1184#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1188#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1180#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1176#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), 281#true, threadThread1of2ForFork0InUse, 217#L1043-2true, threadThread2of2ForFork0InUse, Black: 246#true])
[2024-03-12 00:51:03,838 INFO  L294   olderBase$Statistics]: this new event has 182 ancestors and is cut-off event
[2024-03-12 00:51:03,838 INFO  L297   olderBase$Statistics]:   existing Event has 182 ancestors and is cut-off event
[2024-03-12 00:51:03,838 INFO  L297   olderBase$Statistics]:   existing Event has 182 ancestors and is cut-off event
[2024-03-12 00:51:03,838 INFO  L297   olderBase$Statistics]:   existing Event has 182 ancestors and is cut-off event
