./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/thread-join-array-dynamic-race-2.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/thread-join-array-dynamic-race-2.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 a57abe50161031a2dc44e6680c8ccaa4cc1242722165bf3b4ebdca4fa30d7320
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-09 06:36:49,498 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-09 06:36:49,536 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-09 06:36:49,539 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-09 06:36:49,539 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-09 06:36:49,556 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-09 06:36:49,556 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-09 06:36:49,556 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-09 06:36:49,557 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-09 06:36:49,557 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-09 06:36:49,558 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-09 06:36:49,558 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-09 06:36:49,558 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-09 06:36:49,558 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-09 06:36:49,559 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-09 06:36:49,559 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-09 06:36:49,559 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-09 06:36:49,559 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-09 06:36:49,560 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-09 06:36:49,560 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-09 06:36:49,560 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-09 06:36:49,561 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-09 06:36:49,561 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-09 06:36:49,561 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-09 06:36:49,561 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-09 06:36:49,561 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-09 06:36:49,561 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-09 06:36:49,562 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-09 06:36:49,562 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-09 06:36:49,562 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-09 06:36:49,562 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 06:36:49,562 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-09 06:36:49,563 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-09 06:36:49,563 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-09 06:36:49,563 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-09 06:36:49,563 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-09 06:36:49,563 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-09 06:36:49,563 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-09 06:36:49,564 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-09 06:36:49,564 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-09 06:36:49,564 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-09 06:36:49,564 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 -> a57abe50161031a2dc44e6680c8ccaa4cc1242722165bf3b4ebdca4fa30d7320
[2024-03-09 06:36:49,748 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-09 06:36:49,768 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-09 06:36:49,770 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-09 06:36:49,771 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-09 06:36:49,772 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-09 06:36:49,773 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic-race-2.i
[2024-03-09 06:36:50,820 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-09 06:36:51,003 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-09 06:36:51,004 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-dynamic-race-2.i
[2024-03-09 06:36:51,021 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/0984383b1/371ebf14c844485d99d6cfd645a7d181/FLAGa98096aeb
[2024-03-09 06:36:51,033 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/0984383b1/371ebf14c844485d99d6cfd645a7d181
[2024-03-09 06:36:51,035 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-09 06:36:51,036 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-09 06:36:51,037 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-09 06:36:51,037 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-09 06:36:51,040 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-09 06:36:51,041 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:36:51" (1/1) ...
[2024-03-09 06:36:51,042 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a8fbe34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:51, skipping insertion in model container
[2024-03-09 06:36:51,042 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:36:51" (1/1) ...
[2024-03-09 06:36:51,083 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-09 06:36:51,379 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 06:36:51,389 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-09 06:36:51,418 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 06:36:51,457 INFO  L206         MainTranslator]: Completed translation
[2024-03-09 06:36:51,457 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:51 WrapperNode
[2024-03-09 06:36:51,457 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-09 06:36:51,458 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-09 06:36:51,458 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-09 06:36:51,458 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-09 06:36:51,463 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:51" (1/1) ...
[2024-03-09 06:36:51,476 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:51" (1/1) ...
[2024-03-09 06:36:51,495 INFO  L138                Inliner]: procedures = 269, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84
[2024-03-09 06:36:51,495 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-09 06:36:51,496 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-09 06:36:51,496 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-09 06:36:51,496 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-09 06:36:51,503 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:51" (1/1) ...
[2024-03-09 06:36:51,503 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:51" (1/1) ...
[2024-03-09 06:36:51,507 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:51" (1/1) ...
[2024-03-09 06:36:51,507 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:51" (1/1) ...
[2024-03-09 06:36:51,512 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:51" (1/1) ...
[2024-03-09 06:36:51,515 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:51" (1/1) ...
[2024-03-09 06:36:51,516 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:51" (1/1) ...
[2024-03-09 06:36:51,517 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:51" (1/1) ...
[2024-03-09 06:36:51,519 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-09 06:36:51,520 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-09 06:36:51,520 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-09 06:36:51,520 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-09 06:36:51,520 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:51" (1/1) ...
[2024-03-09 06:36:51,525 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 06:36:51,533 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:36:51,544 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-09 06:36:51,565 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-09 06:36:51,588 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-09 06:36:51,588 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-09 06:36:51,588 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-09 06:36:51,589 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-09 06:36:51,589 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-03-09 06:36:51,589 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-09 06:36:51,589 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-09 06:36:51,589 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-03-09 06:36:51,589 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-09 06:36:51,589 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-03-09 06:36:51,589 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-03-09 06:36:51,589 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-09 06:36:51,589 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-09 06:36:51,590 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-09 06:36:51,590 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-09 06:36:51,591 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-09 06:36:51,741 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-09 06:36:51,742 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-09 06:36:51,932 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-09 06:36:51,946 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-09 06:36:51,946 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-09 06:36:51,947 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 06:36:51 BoogieIcfgContainer
[2024-03-09 06:36:51,947 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-09 06:36:51,949 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-09 06:36:51,949 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-09 06:36:51,951 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-09 06:36:51,952 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:36:51" (1/3) ...
[2024-03-09 06:36:51,952 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267c4dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:36:51, skipping insertion in model container
[2024-03-09 06:36:51,952 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:36:51" (2/3) ...
[2024-03-09 06:36:51,953 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267c4dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:36:51, skipping insertion in model container
[2024-03-09 06:36:51,953 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 06:36:51" (3/3) ...
[2024-03-09 06:36:51,954 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic-race-2.i
[2024-03-09 06:36:51,960 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-09 06:36:51,967 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-09 06:36:51,967 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations.
[2024-03-09 06:36:51,968 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-09 06:36:52,006 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-09 06:36:52,033 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 107 places, 108 transitions, 223 flow
[2024-03-09 06:36:52,081 INFO  L124   PetriNetUnfolderBase]: 6/159 cut-off events.
[2024-03-09 06:36:52,081 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-09 06:36:52,085 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 164 conditions, 159 events. 6/159 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 323 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. 
[2024-03-09 06:36:52,085 INFO  L82        GeneralOperation]: Start removeDead. Operand has 107 places, 108 transitions, 223 flow
[2024-03-09 06:36:52,089 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 107 places, 108 transitions, 223 flow
[2024-03-09 06:36:52,096 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 06:36:52,102 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;@7eae7aed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 06:36:52,102 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-03-09 06:36:52,112 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 06:36:52,112 INFO  L124   PetriNetUnfolderBase]: 3/52 cut-off events.
[2024-03-09 06:36:52,112 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 06:36:52,112 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:52,113 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]
[2024-03-09 06:36:52,113 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:36:52,117 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:52,117 INFO  L85        PathProgramCache]: Analyzing trace with hash 600524965, now seen corresponding path program 1 times
[2024-03-09 06:36:52,124 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:52,124 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386392853]
[2024-03-09 06:36:52,124 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:52,125 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:52,222 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:52,605 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-09 06:36:52,605 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:52,605 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386392853]
[2024-03-09 06:36:52,606 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386392853] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:36:52,606 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:36:52,606 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:36:52,607 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677015132]
[2024-03-09 06:36:52,608 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:36:52,614 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:36:52,618 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:52,637 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:36:52,637 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:36:52,796 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 79 out of 108
[2024-03-09 06:36:52,799 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 108 transitions, 223 flow. Second operand  has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 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-09 06:36:52,799 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:52,799 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 108
[2024-03-09 06:36:52,800 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:52,871 INFO  L124   PetriNetUnfolderBase]: 36/304 cut-off events.
[2024-03-09 06:36:52,871 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-09 06:36:52,872 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 426 conditions, 304 events. 36/304 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1249 event pairs, 30 based on Foata normal form. 8/279 useless extension candidates. Maximal degree in co-relation 296. Up to 93 conditions per place. 
[2024-03-09 06:36:52,874 INFO  L140   encePairwiseOnDemand]: 89/108 looper letters, 23 selfloop transitions, 13 changer transitions 2/116 dead transitions.
[2024-03-09 06:36:52,874 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 116 transitions, 313 flow
[2024-03-09 06:36:52,875 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:36:52,878 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:36:52,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 519 transitions.
[2024-03-09 06:36:52,887 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8009259259259259
[2024-03-09 06:36:52,887 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 519 transitions.
[2024-03-09 06:36:52,888 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 519 transitions.
[2024-03-09 06:36:52,889 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:52,891 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 519 transitions.
[2024-03-09 06:36:52,895 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 0 states have call successors, (0), 0 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-09 06:36:52,899 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 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-09 06:36:52,900 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 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-09 06:36:52,901 INFO  L175             Difference]: Start difference. First operand has 107 places, 108 transitions, 223 flow. Second operand 6 states and 519 transitions.
[2024-03-09 06:36:52,902 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 116 transitions, 313 flow
[2024-03-09 06:36:52,904 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 116 transitions, 313 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:36:52,908 INFO  L231             Difference]: Finished difference. Result has 113 places, 113 transitions, 305 flow
[2024-03-09 06:36:52,909 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=113, PETRI_TRANSITIONS=113}
[2024-03-09 06:36:52,912 INFO  L281   CegarLoopForPetriNet]: 107 programPoint places, 6 predicate places.
[2024-03-09 06:36:52,913 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 305 flow
[2024-03-09 06:36:52,913 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 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-09 06:36:52,913 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:52,913 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]
[2024-03-09 06:36:52,913 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-09 06:36:52,914 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:36:52,914 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:52,914 INFO  L85        PathProgramCache]: Analyzing trace with hash -2032400167, now seen corresponding path program 1 times
[2024-03-09 06:36:52,914 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:52,914 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830321115]
[2024-03-09 06:36:52,915 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:52,915 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:52,929 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:52,953 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-09 06:36:52,953 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:52,953 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830321115]
[2024-03-09 06:36:52,953 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830321115] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:36:52,953 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:36:52,954 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:36:52,954 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321262792]
[2024-03-09 06:36:52,954 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:36:52,955 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:36:52,956 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:52,956 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:36:52,956 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:36:52,962 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 108
[2024-03-09 06:36:52,963 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 305 flow. Second operand  has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 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-09 06:36:52,963 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:52,963 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 108
[2024-03-09 06:36:52,963 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:52,993 INFO  L124   PetriNetUnfolderBase]: 9/209 cut-off events.
[2024-03-09 06:36:52,994 INFO  L125   PetriNetUnfolderBase]: For 15/18 co-relation queries the response was YES.
[2024-03-09 06:36:52,994 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 296 conditions, 209 events. 9/209 cut-off events. For 15/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 528 event pairs, 1 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 172. Up to 16 conditions per place. 
[2024-03-09 06:36:52,995 INFO  L140   encePairwiseOnDemand]: 104/108 looper letters, 8 selfloop transitions, 3 changer transitions 5/117 dead transitions.
[2024-03-09 06:36:52,995 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 117 transitions, 337 flow
[2024-03-09 06:36:52,995 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:36:52,995 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:36:52,996 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions.
[2024-03-09 06:36:52,997 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9382716049382716
[2024-03-09 06:36:52,997 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 304 transitions.
[2024-03-09 06:36:52,997 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions.
[2024-03-09 06:36:52,997 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:52,997 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions.
[2024-03-09 06:36:52,998 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 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-09 06:36:52,999 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:52,999 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:52,999 INFO  L175             Difference]: Start difference. First operand has 113 places, 113 transitions, 305 flow. Second operand 3 states and 304 transitions.
[2024-03-09 06:36:52,999 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 117 transitions, 337 flow
[2024-03-09 06:36:53,001 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 117 transitions, 333 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 06:36:53,002 INFO  L231             Difference]: Finished difference. Result has 115 places, 111 transitions, 301 flow
[2024-03-09 06:36:53,003 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=301, PETRI_PLACES=115, PETRI_TRANSITIONS=111}
[2024-03-09 06:36:53,003 INFO  L281   CegarLoopForPetriNet]: 107 programPoint places, 8 predicate places.
[2024-03-09 06:36:53,004 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 111 transitions, 301 flow
[2024-03-09 06:36:53,004 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 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-09 06:36:53,004 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:53,004 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]
[2024-03-09 06:36:53,004 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-09 06:36:53,004 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:36:53,005 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:53,005 INFO  L85        PathProgramCache]: Analyzing trace with hash 767401656, now seen corresponding path program 1 times
[2024-03-09 06:36:53,005 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:53,005 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136082673]
[2024-03-09 06:36:53,006 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:53,006 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:53,019 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:53,074 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-09 06:36:53,075 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:53,075 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136082673]
[2024-03-09 06:36:53,075 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136082673] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:36:53,076 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:36:53,076 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:36:53,076 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008841021]
[2024-03-09 06:36:53,076 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:36:53,077 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 06:36:53,077 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:53,078 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 06:36:53,078 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 06:36:53,127 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 108
[2024-03-09 06:36:53,127 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 301 flow. Second operand  has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 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-09 06:36:53,128 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:53,128 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 108
[2024-03-09 06:36:53,128 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:53,173 INFO  L124   PetriNetUnfolderBase]: 16/289 cut-off events.
[2024-03-09 06:36:53,174 INFO  L125   PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES.
[2024-03-09 06:36:53,175 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 435 conditions, 289 events. 16/289 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1029 event pairs, 1 based on Foata normal form. 1/277 useless extension candidates. Maximal degree in co-relation 323. Up to 48 conditions per place. 
[2024-03-09 06:36:53,175 INFO  L140   encePairwiseOnDemand]: 101/108 looper letters, 15 selfloop transitions, 2 changer transitions 4/113 dead transitions.
[2024-03-09 06:36:53,175 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 113 transitions, 333 flow
[2024-03-09 06:36:53,176 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:36:53,176 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:36:53,177 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 562 transitions.
[2024-03-09 06:36:53,177 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8672839506172839
[2024-03-09 06:36:53,177 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 562 transitions.
[2024-03-09 06:36:53,178 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 562 transitions.
[2024-03-09 06:36:53,178 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:53,178 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 562 transitions.
[2024-03-09 06:36:53,179 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 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-09 06:36:53,180 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 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-09 06:36:53,181 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 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-09 06:36:53,181 INFO  L175             Difference]: Start difference. First operand has 115 places, 111 transitions, 301 flow. Second operand 6 states and 562 transitions.
[2024-03-09 06:36:53,181 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 113 transitions, 333 flow
[2024-03-09 06:36:53,183 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 113 transitions, 313 flow, removed 7 selfloop flow, removed 2 redundant places.
[2024-03-09 06:36:53,185 INFO  L231             Difference]: Finished difference. Result has 122 places, 107 transitions, 275 flow
[2024-03-09 06:36:53,185 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=122, PETRI_TRANSITIONS=107}
[2024-03-09 06:36:53,186 INFO  L281   CegarLoopForPetriNet]: 107 programPoint places, 15 predicate places.
[2024-03-09 06:36:53,186 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 107 transitions, 275 flow
[2024-03-09 06:36:53,186 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 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-09 06:36:53,186 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:53,186 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]
[2024-03-09 06:36:53,186 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-09 06:36:53,187 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:36:53,187 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:53,187 INFO  L85        PathProgramCache]: Analyzing trace with hash 2137674055, now seen corresponding path program 1 times
[2024-03-09 06:36:53,187 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:53,188 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111963770]
[2024-03-09 06:36:53,188 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:53,188 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:53,201 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:53,220 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-09 06:36:53,220 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:53,221 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111963770]
[2024-03-09 06:36:53,221 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111963770] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:36:53,221 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:36:53,221 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:36:53,221 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720700250]
[2024-03-09 06:36:53,221 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:36:53,221 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:36:53,222 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:53,222 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:36:53,222 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:36:53,232 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 108
[2024-03-09 06:36:53,232 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 107 transitions, 275 flow. Second operand  has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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-09 06:36:53,232 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:53,232 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 108
[2024-03-09 06:36:53,232 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:53,265 INFO  L124   PetriNetUnfolderBase]: 5/207 cut-off events.
[2024-03-09 06:36:53,265 INFO  L125   PetriNetUnfolderBase]: For 20/33 co-relation queries the response was YES.
[2024-03-09 06:36:53,266 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 301 conditions, 207 events. 5/207 cut-off events. For 20/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 548 event pairs, 3 based on Foata normal form. 1/198 useless extension candidates. Maximal degree in co-relation 241. Up to 25 conditions per place. 
[2024-03-09 06:36:53,266 INFO  L140   encePairwiseOnDemand]: 103/108 looper letters, 8 selfloop transitions, 4 changer transitions 3/110 dead transitions.
[2024-03-09 06:36:53,266 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 110 transitions, 311 flow
[2024-03-09 06:36:53,266 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:36:53,267 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:36:53,267 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions.
[2024-03-09 06:36:53,267 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9228395061728395
[2024-03-09 06:36:53,267 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 299 transitions.
[2024-03-09 06:36:53,267 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions.
[2024-03-09 06:36:53,268 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:53,268 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions.
[2024-03-09 06:36:53,268 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 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-09 06:36:53,269 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:53,269 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:36:53,270 INFO  L175             Difference]: Start difference. First operand has 122 places, 107 transitions, 275 flow. Second operand 3 states and 299 transitions.
[2024-03-09 06:36:53,270 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 110 transitions, 311 flow
[2024-03-09 06:36:53,271 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 110 transitions, 297 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-03-09 06:36:53,272 INFO  L231             Difference]: Finished difference. Result has 118 places, 107 transitions, 283 flow
[2024-03-09 06:36:53,272 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=283, PETRI_PLACES=118, PETRI_TRANSITIONS=107}
[2024-03-09 06:36:53,273 INFO  L281   CegarLoopForPetriNet]: 107 programPoint places, 11 predicate places.
[2024-03-09 06:36:53,273 INFO  L495      AbstractCegarLoop]: Abstraction has has 118 places, 107 transitions, 283 flow
[2024-03-09 06:36:53,273 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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-09 06:36:53,273 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:53,274 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 06:36:53,274 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-09 06:36:53,274 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 06:36:53,274 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:53,275 INFO  L85        PathProgramCache]: Analyzing trace with hash -982835223, now seen corresponding path program 1 times
[2024-03-09 06:36:53,275 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:53,275 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065066299]
[2024-03-09 06:36:53,275 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:53,275 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:53,294 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:36:53,294 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 06:36:53,320 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:36:53,339 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 06:36:53,339 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 06:36:53,340 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining)
[2024-03-09 06:36:53,342 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2024-03-09 06:36:53,342 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2024-03-09 06:36:53,342 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining)
[2024-03-09 06:36:53,342 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2024-03-09 06:36:53,342 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2024-03-09 06:36:53,343 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2024-03-09 06:36:53,343 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2024-03-09 06:36:53,343 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-09 06:36:53,343 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2024-03-09 06:36:53,345 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 06:36:53,345 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-09 06:36:53,360 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-09 06:36:53,362 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 126 places, 126 transitions, 268 flow
[2024-03-09 06:36:53,381 INFO  L124   PetriNetUnfolderBase]: 11/278 cut-off events.
[2024-03-09 06:36:53,382 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-09 06:36:53,382 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 290 conditions, 278 events. 11/278 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 672 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 161. Up to 8 conditions per place. 
[2024-03-09 06:36:53,382 INFO  L82        GeneralOperation]: Start removeDead. Operand has 126 places, 126 transitions, 268 flow
[2024-03-09 06:36:53,384 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 126 places, 126 transitions, 268 flow
[2024-03-09 06:36:53,384 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 06:36:53,385 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;@7eae7aed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 06:36:53,385 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-03-09 06:36:53,388 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 06:36:53,388 INFO  L124   PetriNetUnfolderBase]: 3/52 cut-off events.
[2024-03-09 06:36:53,389 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 06:36:53,389 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:53,389 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]
[2024-03-09 06:36:53,389 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:36:53,389 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:53,389 INFO  L85        PathProgramCache]: Analyzing trace with hash 1985541157, now seen corresponding path program 1 times
[2024-03-09 06:36:53,389 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:53,390 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330619274]
[2024-03-09 06:36:53,390 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:53,390 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:53,400 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:53,570 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-09 06:36:53,570 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:53,570 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330619274]
[2024-03-09 06:36:53,570 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330619274] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:36:53,571 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:36:53,571 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:36:53,571 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978656787]
[2024-03-09 06:36:53,571 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:36:53,571 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:36:53,571 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:53,572 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:36:53,572 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:36:53,731 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 126
[2024-03-09 06:36:53,731 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 126 transitions, 268 flow. Second operand  has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 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-09 06:36:53,732 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:53,732 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 126
[2024-03-09 06:36:53,732 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:53,926 INFO  L124   PetriNetUnfolderBase]: 280/1685 cut-off events.
[2024-03-09 06:36:53,927 INFO  L125   PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES.
[2024-03-09 06:36:53,930 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2271 conditions, 1685 events. 280/1685 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 13276 event pairs, 240 based on Foata normal form. 24/1578 useless extension candidates. Maximal degree in co-relation 729. Up to 488 conditions per place. 
[2024-03-09 06:36:53,935 INFO  L140   encePairwiseOnDemand]: 107/126 looper letters, 30 selfloop transitions, 13 changer transitions 1/136 dead transitions.
[2024-03-09 06:36:53,935 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 136 transitions, 374 flow
[2024-03-09 06:36:53,936 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:36:53,936 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:36:53,937 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 609 transitions.
[2024-03-09 06:36:53,937 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8055555555555556
[2024-03-09 06:36:53,937 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 609 transitions.
[2024-03-09 06:36:53,937 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 609 transitions.
[2024-03-09 06:36:53,938 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:53,938 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 609 transitions.
[2024-03-09 06:36:53,939 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 0 states have call successors, (0), 0 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-09 06:36:53,940 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 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-09 06:36:53,940 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 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-09 06:36:53,940 INFO  L175             Difference]: Start difference. First operand has 126 places, 126 transitions, 268 flow. Second operand 6 states and 609 transitions.
[2024-03-09 06:36:53,940 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 136 transitions, 374 flow
[2024-03-09 06:36:53,941 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 136 transitions, 374 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:36:53,943 INFO  L231             Difference]: Finished difference. Result has 132 places, 131 transitions, 350 flow
[2024-03-09 06:36:53,943 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=350, PETRI_PLACES=132, PETRI_TRANSITIONS=131}
[2024-03-09 06:36:53,944 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 6 predicate places.
[2024-03-09 06:36:53,944 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 131 transitions, 350 flow
[2024-03-09 06:36:53,944 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 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-09 06:36:53,944 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:53,944 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]
[2024-03-09 06:36:53,945 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-09 06:36:53,945 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:36:53,945 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:53,945 INFO  L85        PathProgramCache]: Analyzing trace with hash 378041241, now seen corresponding path program 1 times
[2024-03-09 06:36:53,945 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:53,946 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304215386]
[2024-03-09 06:36:53,946 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:53,946 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:53,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:53,967 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-09 06:36:53,967 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:53,967 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304215386]
[2024-03-09 06:36:53,968 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304215386] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:36:53,968 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:36:53,968 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:36:53,968 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402480799]
[2024-03-09 06:36:53,968 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:36:53,968 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:36:53,968 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:53,969 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:36:53,969 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:36:53,979 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 110 out of 126
[2024-03-09 06:36:53,979 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 131 transitions, 350 flow. Second operand  has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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-09 06:36:53,980 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:53,980 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 126
[2024-03-09 06:36:53,980 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:54,091 INFO  L124   PetriNetUnfolderBase]: 120/876 cut-off events.
[2024-03-09 06:36:54,092 INFO  L125   PetriNetUnfolderBase]: For 100/143 co-relation queries the response was YES.
[2024-03-09 06:36:54,094 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1265 conditions, 876 events. 120/876 cut-off events. For 100/143 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5183 event pairs, 50 based on Foata normal form. 0/786 useless extension candidates. Maximal degree in co-relation 1040. Up to 139 conditions per place. 
[2024-03-09 06:36:54,096 INFO  L140   encePairwiseOnDemand]: 121/126 looper letters, 16 selfloop transitions, 4 changer transitions 4/138 dead transitions.
[2024-03-09 06:36:54,096 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 138 transitions, 404 flow
[2024-03-09 06:36:54,096 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:36:54,096 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:36:54,097 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions.
[2024-03-09 06:36:54,097 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9285714285714286
[2024-03-09 06:36:54,097 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 351 transitions.
[2024-03-09 06:36:54,097 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions.
[2024-03-09 06:36:54,097 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:54,097 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions.
[2024-03-09 06:36:54,098 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 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-09 06:36:54,099 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 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-09 06:36:54,099 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 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-09 06:36:54,099 INFO  L175             Difference]: Start difference. First operand has 132 places, 131 transitions, 350 flow. Second operand 3 states and 351 transitions.
[2024-03-09 06:36:54,099 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 138 transitions, 404 flow
[2024-03-09 06:36:54,101 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 138 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 06:36:54,103 INFO  L231             Difference]: Finished difference. Result has 134 places, 130 transitions, 354 flow
[2024-03-09 06:36:54,103 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=134, PETRI_TRANSITIONS=130}
[2024-03-09 06:36:54,104 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 8 predicate places.
[2024-03-09 06:36:54,104 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 130 transitions, 354 flow
[2024-03-09 06:36:54,104 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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-09 06:36:54,104 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:54,104 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]
[2024-03-09 06:36:54,104 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-09 06:36:54,104 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:36:54,105 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:54,105 INFO  L85        PathProgramCache]: Analyzing trace with hash -1818325898, now seen corresponding path program 1 times
[2024-03-09 06:36:54,105 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:54,105 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492374396]
[2024-03-09 06:36:54,105 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:54,105 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:54,115 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:54,159 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-09 06:36:54,159 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:54,159 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492374396]
[2024-03-09 06:36:54,159 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492374396] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:36:54,159 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:36:54,160 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:36:54,160 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920635388]
[2024-03-09 06:36:54,160 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:36:54,160 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 06:36:54,160 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:54,161 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 06:36:54,161 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 06:36:54,221 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 126
[2024-03-09 06:36:54,222 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 130 transitions, 354 flow. Second operand  has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 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-09 06:36:54,222 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:54,222 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 126
[2024-03-09 06:36:54,222 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:54,347 INFO  L124   PetriNetUnfolderBase]: 185/1303 cut-off events.
[2024-03-09 06:36:54,347 INFO  L125   PetriNetUnfolderBase]: For 69/70 co-relation queries the response was YES.
[2024-03-09 06:36:54,351 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1900 conditions, 1303 events. 185/1303 cut-off events. For 69/70 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 9448 event pairs, 130 based on Foata normal form. 1/1210 useless extension candidates. Maximal degree in co-relation 1271. Up to 311 conditions per place. 
[2024-03-09 06:36:54,355 INFO  L140   encePairwiseOnDemand]: 119/126 looper letters, 20 selfloop transitions, 2 changer transitions 4/133 dead transitions.
[2024-03-09 06:36:54,355 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 133 transitions, 398 flow
[2024-03-09 06:36:54,355 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:36:54,355 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:36:54,356 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 651 transitions.
[2024-03-09 06:36:54,357 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8611111111111112
[2024-03-09 06:36:54,357 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 651 transitions.
[2024-03-09 06:36:54,357 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 651 transitions.
[2024-03-09 06:36:54,357 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:54,357 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 651 transitions.
[2024-03-09 06:36:54,358 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 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-09 06:36:54,360 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 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-09 06:36:54,360 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 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-09 06:36:54,360 INFO  L175             Difference]: Start difference. First operand has 134 places, 130 transitions, 354 flow. Second operand 6 states and 651 transitions.
[2024-03-09 06:36:54,360 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 133 transitions, 398 flow
[2024-03-09 06:36:54,362 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 133 transitions, 376 flow, removed 7 selfloop flow, removed 2 redundant places.
[2024-03-09 06:36:54,363 INFO  L231             Difference]: Finished difference. Result has 141 places, 127 transitions, 330 flow
[2024-03-09 06:36:54,363 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=141, PETRI_TRANSITIONS=127}
[2024-03-09 06:36:54,364 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 15 predicate places.
[2024-03-09 06:36:54,364 INFO  L495      AbstractCegarLoop]: Abstraction has has 141 places, 127 transitions, 330 flow
[2024-03-09 06:36:54,364 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 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-09 06:36:54,364 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:54,364 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]
[2024-03-09 06:36:54,364 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-09 06:36:54,365 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:36:54,365 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:54,365 INFO  L85        PathProgramCache]: Analyzing trace with hash 1347711349, now seen corresponding path program 1 times
[2024-03-09 06:36:54,365 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:54,365 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817110541]
[2024-03-09 06:36:54,365 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:54,365 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:54,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:54,390 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-09 06:36:54,391 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:54,391 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817110541]
[2024-03-09 06:36:54,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817110541] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:36:54,391 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:36:54,391 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:36:54,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72703670]
[2024-03-09 06:36:54,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:36:54,392 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:36:54,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:54,392 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:36:54,392 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:36:54,404 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 108 out of 126
[2024-03-09 06:36:54,404 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 127 transitions, 330 flow. Second operand  has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 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-09 06:36:54,404 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:54,404 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 126
[2024-03-09 06:36:54,404 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:54,555 INFO  L124   PetriNetUnfolderBase]: 172/1212 cut-off events.
[2024-03-09 06:36:54,555 INFO  L125   PetriNetUnfolderBase]: For 230/473 co-relation queries the response was YES.
[2024-03-09 06:36:54,560 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1854 conditions, 1212 events. 172/1212 cut-off events. For 230/473 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 8775 event pairs, 77 based on Foata normal form. 3/1066 useless extension candidates. Maximal degree in co-relation 1784. Up to 270 conditions per place. 
[2024-03-09 06:36:54,564 INFO  L140   encePairwiseOnDemand]: 120/126 looper letters, 19 selfloop transitions, 7 changer transitions 0/136 dead transitions.
[2024-03-09 06:36:54,564 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 136 transitions, 414 flow
[2024-03-09 06:36:54,564 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:36:54,565 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:36:54,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions.
[2024-03-09 06:36:54,565 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9206349206349206
[2024-03-09 06:36:54,565 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 348 transitions.
[2024-03-09 06:36:54,565 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions.
[2024-03-09 06:36:54,566 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:54,566 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions.
[2024-03-09 06:36:54,566 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 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-09 06:36:54,567 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 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-09 06:36:54,567 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 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-09 06:36:54,567 INFO  L175             Difference]: Start difference. First operand has 141 places, 127 transitions, 330 flow. Second operand 3 states and 348 transitions.
[2024-03-09 06:36:54,568 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 136 transitions, 414 flow
[2024-03-09 06:36:54,569 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 136 transitions, 402 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-09 06:36:54,570 INFO  L231             Difference]: Finished difference. Result has 138 places, 132 transitions, 374 flow
[2024-03-09 06:36:54,570 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=138, PETRI_TRANSITIONS=132}
[2024-03-09 06:36:54,571 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 12 predicate places.
[2024-03-09 06:36:54,571 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 132 transitions, 374 flow
[2024-03-09 06:36:54,571 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 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-09 06:36:54,571 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:54,571 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-09 06:36:54,572 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-09 06:36:54,572 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:36:54,572 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:54,572 INFO  L85        PathProgramCache]: Analyzing trace with hash 2020846673, now seen corresponding path program 1 times
[2024-03-09 06:36:54,572 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:54,572 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441487600]
[2024-03-09 06:36:54,572 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:54,572 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:54,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:54,828 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-09 06:36:54,828 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:54,828 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441487600]
[2024-03-09 06:36:54,828 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441487600] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:36:54,828 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:36:54,828 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:36:54,828 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720757682]
[2024-03-09 06:36:54,828 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:36:54,829 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:36:54,829 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:54,829 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:36:54,829 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:36:55,068 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 126
[2024-03-09 06:36:55,068 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 132 transitions, 374 flow. Second operand  has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 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-09 06:36:55,068 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:55,068 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 126
[2024-03-09 06:36:55,068 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:55,285 INFO  L124   PetriNetUnfolderBase]: 303/1623 cut-off events.
[2024-03-09 06:36:55,285 INFO  L125   PetriNetUnfolderBase]: For 243/261 co-relation queries the response was YES.
[2024-03-09 06:36:55,288 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2659 conditions, 1623 events. 303/1623 cut-off events. For 243/261 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 12754 event pairs, 130 based on Foata normal form. 2/1498 useless extension candidates. Maximal degree in co-relation 2225. Up to 285 conditions per place. 
[2024-03-09 06:36:55,292 INFO  L140   encePairwiseOnDemand]: 120/126 looper letters, 31 selfloop transitions, 5 changer transitions 0/147 dead transitions.
[2024-03-09 06:36:55,292 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 147 transitions, 476 flow
[2024-03-09 06:36:55,293 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:36:55,293 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:36:55,294 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 649 transitions.
[2024-03-09 06:36:55,294 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8584656084656085
[2024-03-09 06:36:55,294 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 649 transitions.
[2024-03-09 06:36:55,294 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 649 transitions.
[2024-03-09 06:36:55,295 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:55,295 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 649 transitions.
[2024-03-09 06:36:55,296 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 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-09 06:36:55,298 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 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-09 06:36:55,298 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 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-09 06:36:55,298 INFO  L175             Difference]: Start difference. First operand has 138 places, 132 transitions, 374 flow. Second operand 6 states and 649 transitions.
[2024-03-09 06:36:55,298 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 147 transitions, 476 flow
[2024-03-09 06:36:55,300 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 147 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:36:55,302 INFO  L231             Difference]: Finished difference. Result has 140 places, 131 transitions, 368 flow
[2024-03-09 06:36:55,302 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=368, PETRI_PLACES=140, PETRI_TRANSITIONS=131}
[2024-03-09 06:36:55,302 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 14 predicate places.
[2024-03-09 06:36:55,302 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 131 transitions, 368 flow
[2024-03-09 06:36:55,303 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 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-09 06:36:55,303 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:55,303 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 06:36:55,303 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-09 06:36:55,303 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:36:55,304 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:55,304 INFO  L85        PathProgramCache]: Analyzing trace with hash -1530030849, now seen corresponding path program 1 times
[2024-03-09 06:36:55,304 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:55,304 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636461120]
[2024-03-09 06:36:55,304 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:55,304 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:55,319 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:55,344 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-03-09 06:36:55,345 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:55,345 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636461120]
[2024-03-09 06:36:55,345 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636461120] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:36:55,345 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:36:55,345 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:36:55,345 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636785173]
[2024-03-09 06:36:55,345 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:36:55,346 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:36:55,346 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:55,346 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:36:55,346 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:36:55,360 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 108 out of 126
[2024-03-09 06:36:55,360 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 131 transitions, 368 flow. Second operand  has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 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-09 06:36:55,360 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:55,360 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 126
[2024-03-09 06:36:55,360 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:55,524 INFO  L124   PetriNetUnfolderBase]: 236/1627 cut-off events.
[2024-03-09 06:36:55,524 INFO  L125   PetriNetUnfolderBase]: For 616/2073 co-relation queries the response was YES.
[2024-03-09 06:36:55,528 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2770 conditions, 1627 events. 236/1627 cut-off events. For 616/2073 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 13335 event pairs, 94 based on Foata normal form. 2/1475 useless extension candidates. Maximal degree in co-relation 2487. Up to 351 conditions per place. 
[2024-03-09 06:36:55,532 INFO  L140   encePairwiseOnDemand]: 120/126 looper letters, 19 selfloop transitions, 10 changer transitions 0/140 dead transitions.
[2024-03-09 06:36:55,532 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 140 transitions, 463 flow
[2024-03-09 06:36:55,533 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:36:55,533 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:36:55,533 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions.
[2024-03-09 06:36:55,533 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.917989417989418
[2024-03-09 06:36:55,534 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 347 transitions.
[2024-03-09 06:36:55,534 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions.
[2024-03-09 06:36:55,534 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:55,534 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions.
[2024-03-09 06:36:55,535 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 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-09 06:36:55,535 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 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-09 06:36:55,536 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 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-09 06:36:55,536 INFO  L175             Difference]: Start difference. First operand has 140 places, 131 transitions, 368 flow. Second operand 3 states and 347 transitions.
[2024-03-09 06:36:55,536 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 140 transitions, 463 flow
[2024-03-09 06:36:55,538 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 140 transitions, 453 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-09 06:36:55,539 INFO  L231             Difference]: Finished difference. Result has 139 places, 137 transitions, 440 flow
[2024-03-09 06:36:55,540 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=139, PETRI_TRANSITIONS=137}
[2024-03-09 06:36:55,540 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 13 predicate places.
[2024-03-09 06:36:55,540 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 137 transitions, 440 flow
[2024-03-09 06:36:55,540 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 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-09 06:36:55,541 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:55,541 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]
[2024-03-09 06:36:55,541 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-09 06:36:55,541 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:36:55,541 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:55,541 INFO  L85        PathProgramCache]: Analyzing trace with hash 1631205389, now seen corresponding path program 1 times
[2024-03-09 06:36:55,541 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:55,541 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300657088]
[2024-03-09 06:36:55,542 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:55,542 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:55,553 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:55,614 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-09 06:36:55,615 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:55,615 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300657088]
[2024-03-09 06:36:55,615 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300657088] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:36:55,616 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052829064]
[2024-03-09 06:36:55,616 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:55,616 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:36:55,616 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:36:55,620 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-09 06:36:55,628 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-09 06:36:55,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:55,737 INFO  L262         TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-09 06:36:55,741 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:36:55,830 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-09 06:36:55,830 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:36:55,888 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-09 06:36:55,888 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052829064] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:36:55,888 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:36:55,888 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9
[2024-03-09 06:36:55,888 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506521362]
[2024-03-09 06:36:55,889 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:36:55,889 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-09 06:36:55,889 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:55,889 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-09 06:36:55,890 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-09 06:36:56,029 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 126
[2024-03-09 06:36:56,030 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 137 transitions, 440 flow. Second operand  has 9 states, 9 states have (on average 104.33333333333333) internal successors, (939), 9 states have internal predecessors, (939), 0 states have call successors, (0), 0 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-09 06:36:56,030 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:56,030 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 126
[2024-03-09 06:36:56,030 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:56,275 INFO  L124   PetriNetUnfolderBase]: 186/1459 cut-off events.
[2024-03-09 06:36:56,275 INFO  L125   PetriNetUnfolderBase]: For 392/439 co-relation queries the response was YES.
[2024-03-09 06:36:56,279 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2335 conditions, 1459 events. 186/1459 cut-off events. For 392/439 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 10705 event pairs, 61 based on Foata normal form. 0/1405 useless extension candidates. Maximal degree in co-relation 1631. Up to 179 conditions per place. 
[2024-03-09 06:36:56,282 INFO  L140   encePairwiseOnDemand]: 116/126 looper letters, 25 selfloop transitions, 9 changer transitions 12/157 dead transitions.
[2024-03-09 06:36:56,282 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 157 transitions, 552 flow
[2024-03-09 06:36:56,282 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-03-09 06:36:56,283 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-03-09 06:36:56,284 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 862 transitions.
[2024-03-09 06:36:56,284 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8551587301587301
[2024-03-09 06:36:56,285 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 862 transitions.
[2024-03-09 06:36:56,285 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 862 transitions.
[2024-03-09 06:36:56,285 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:56,285 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 862 transitions.
[2024-03-09 06:36:56,287 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 107.75) internal successors, (862), 8 states have internal predecessors, (862), 0 states have call successors, (0), 0 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-09 06:36:56,289 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 126.0) internal successors, (1134), 9 states have internal predecessors, (1134), 0 states have call successors, (0), 0 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-09 06:36:56,289 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 126.0) internal successors, (1134), 9 states have internal predecessors, (1134), 0 states have call successors, (0), 0 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-09 06:36:56,289 INFO  L175             Difference]: Start difference. First operand has 139 places, 137 transitions, 440 flow. Second operand 8 states and 862 transitions.
[2024-03-09 06:36:56,289 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 157 transitions, 552 flow
[2024-03-09 06:36:56,291 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 157 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:36:56,292 INFO  L231             Difference]: Finished difference. Result has 147 places, 135 transitions, 431 flow
[2024-03-09 06:36:56,293 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=431, PETRI_PLACES=147, PETRI_TRANSITIONS=135}
[2024-03-09 06:36:56,294 INFO  L281   CegarLoopForPetriNet]: 126 programPoint places, 21 predicate places.
[2024-03-09 06:36:56,295 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 135 transitions, 431 flow
[2024-03-09 06:36:56,295 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 104.33333333333333) internal successors, (939), 9 states have internal predecessors, (939), 0 states have call successors, (0), 0 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-09 06:36:56,295 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:56,296 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-03-09 06:36:56,303 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-09 06:36:56,498 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:36:56,498 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-09 06:36:56,500 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:56,500 INFO  L85        PathProgramCache]: Analyzing trace with hash 1083892385, now seen corresponding path program 1 times
[2024-03-09 06:36:56,501 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:56,501 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480887115]
[2024-03-09 06:36:56,501 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:56,502 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:56,536 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:36:56,537 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 06:36:56,554 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:36:56,561 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 06:36:56,562 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 06:36:56,562 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2024-03-09 06:36:56,562 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2024-03-09 06:36:56,562 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2024-03-09 06:36:56,562 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2024-03-09 06:36:56,562 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2024-03-09 06:36:56,562 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2024-03-09 06:36:56,562 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2024-03-09 06:36:56,562 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2024-03-09 06:36:56,563 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2024-03-09 06:36:56,563 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-09 06:36:56,563 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:36:56,563 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 06:36:56,563 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2024-03-09 06:36:56,579 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2024-03-09 06:36:56,580 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 145 places, 144 transitions, 315 flow
[2024-03-09 06:36:56,617 INFO  L124   PetriNetUnfolderBase]: 21/480 cut-off events.
[2024-03-09 06:36:56,617 INFO  L125   PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES.
[2024-03-09 06:36:56,618 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 505 conditions, 480 events. 21/480 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1426 event pairs, 1 based on Foata normal form. 0/416 useless extension candidates. Maximal degree in co-relation 286. Up to 16 conditions per place. 
[2024-03-09 06:36:56,618 INFO  L82        GeneralOperation]: Start removeDead. Operand has 145 places, 144 transitions, 315 flow
[2024-03-09 06:36:56,620 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 145 places, 144 transitions, 315 flow
[2024-03-09 06:36:56,621 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 06:36:56,621 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;@7eae7aed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 06:36:56,621 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2024-03-09 06:36:56,623 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 06:36:56,623 INFO  L124   PetriNetUnfolderBase]: 3/52 cut-off events.
[2024-03-09 06:36:56,623 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 06:36:56,623 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:56,624 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]
[2024-03-09 06:36:56,624 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:36:56,624 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:56,624 INFO  L85        PathProgramCache]: Analyzing trace with hash -726550491, now seen corresponding path program 1 times
[2024-03-09 06:36:56,624 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:56,624 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818771016]
[2024-03-09 06:36:56,624 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:56,624 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:56,633 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:56,763 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-09 06:36:56,763 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:56,763 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818771016]
[2024-03-09 06:36:56,763 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818771016] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:36:56,763 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:36:56,763 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:36:56,763 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152221277]
[2024-03-09 06:36:56,763 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:36:56,764 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:36:56,764 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:56,765 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:36:56,765 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:36:56,909 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 144
[2024-03-09 06:36:56,910 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 144 transitions, 315 flow. Second operand  has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 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-09 06:36:56,910 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:56,910 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 144
[2024-03-09 06:36:56,910 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:57,612 INFO  L124   PetriNetUnfolderBase]: 1609/7784 cut-off events.
[2024-03-09 06:36:57,612 INFO  L125   PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES.
[2024-03-09 06:36:57,624 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10541 conditions, 7784 events. 1609/7784 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 82365 event pairs, 1387 based on Foata normal form. 81/7273 useless extension candidates. Maximal degree in co-relation 3410. Up to 2326 conditions per place. 
[2024-03-09 06:36:57,646 INFO  L140   encePairwiseOnDemand]: 125/144 looper letters, 36 selfloop transitions, 13 changer transitions 1/156 dead transitions.
[2024-03-09 06:36:57,647 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 156 transitions, 437 flow
[2024-03-09 06:36:57,647 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:36:57,647 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:36:57,649 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 699 transitions.
[2024-03-09 06:36:57,649 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8090277777777778
[2024-03-09 06:36:57,649 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 699 transitions.
[2024-03-09 06:36:57,649 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 699 transitions.
[2024-03-09 06:36:57,650 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:57,650 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 699 transitions.
[2024-03-09 06:36:57,651 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 116.5) internal successors, (699), 6 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-09 06:36:57,653 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 144.0) internal successors, (1008), 7 states have internal predecessors, (1008), 0 states have call successors, (0), 0 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-09 06:36:57,653 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 144.0) internal successors, (1008), 7 states have internal predecessors, (1008), 0 states have call successors, (0), 0 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-09 06:36:57,653 INFO  L175             Difference]: Start difference. First operand has 145 places, 144 transitions, 315 flow. Second operand 6 states and 699 transitions.
[2024-03-09 06:36:57,653 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 156 transitions, 437 flow
[2024-03-09 06:36:57,654 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 156 transitions, 437 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:36:57,656 INFO  L231             Difference]: Finished difference. Result has 151 places, 149 transitions, 397 flow
[2024-03-09 06:36:57,656 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=397, PETRI_PLACES=151, PETRI_TRANSITIONS=149}
[2024-03-09 06:36:57,657 INFO  L281   CegarLoopForPetriNet]: 145 programPoint places, 6 predicate places.
[2024-03-09 06:36:57,657 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 149 transitions, 397 flow
[2024-03-09 06:36:57,657 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 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-09 06:36:57,657 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:57,657 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]
[2024-03-09 06:36:57,657 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-09 06:36:57,657 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:36:57,658 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:57,658 INFO  L85        PathProgramCache]: Analyzing trace with hash -1775702631, now seen corresponding path program 1 times
[2024-03-09 06:36:57,658 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:57,658 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017497645]
[2024-03-09 06:36:57,658 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:57,658 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:57,665 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:57,678 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-09 06:36:57,678 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:57,678 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017497645]
[2024-03-09 06:36:57,678 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017497645] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:36:57,679 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:36:57,679 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:36:57,679 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675914527]
[2024-03-09 06:36:57,679 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:36:57,679 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:36:57,679 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:57,680 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:36:57,680 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:36:57,693 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 144
[2024-03-09 06:36:57,694 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 149 transitions, 397 flow. Second operand  has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 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-09 06:36:57,694 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:57,694 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 144
[2024-03-09 06:36:57,694 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:58,144 INFO  L124   PetriNetUnfolderBase]: 1072/4666 cut-off events.
[2024-03-09 06:36:58,144 INFO  L125   PetriNetUnfolderBase]: For 520/868 co-relation queries the response was YES.
[2024-03-09 06:36:58,153 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7002 conditions, 4666 events. 1072/4666 cut-off events. For 520/868 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 43552 event pairs, 542 based on Foata normal form. 0/4183 useless extension candidates. Maximal degree in co-relation 6276. Up to 1110 conditions per place. 
[2024-03-09 06:36:58,165 INFO  L140   encePairwiseOnDemand]: 138/144 looper letters, 23 selfloop transitions, 5 changer transitions 4/159 dead transitions.
[2024-03-09 06:36:58,165 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 159 transitions, 473 flow
[2024-03-09 06:36:58,165 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:36:58,165 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:36:58,166 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions.
[2024-03-09 06:36:58,166 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9212962962962963
[2024-03-09 06:36:58,166 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 398 transitions.
[2024-03-09 06:36:58,166 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions.
[2024-03-09 06:36:58,167 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:58,167 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions.
[2024-03-09 06:36:58,167 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 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-09 06:36:58,168 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 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-09 06:36:58,168 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 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-09 06:36:58,168 INFO  L175             Difference]: Start difference. First operand has 151 places, 149 transitions, 397 flow. Second operand 3 states and 398 transitions.
[2024-03-09 06:36:58,168 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 159 transitions, 473 flow
[2024-03-09 06:36:58,176 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 159 transitions, 469 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 06:36:58,178 INFO  L231             Difference]: Finished difference. Result has 153 places, 149 transitions, 409 flow
[2024-03-09 06:36:58,178 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=409, PETRI_PLACES=153, PETRI_TRANSITIONS=149}
[2024-03-09 06:36:58,178 INFO  L281   CegarLoopForPetriNet]: 145 programPoint places, 8 predicate places.
[2024-03-09 06:36:58,178 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 149 transitions, 409 flow
[2024-03-09 06:36:58,179 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 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-09 06:36:58,179 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:58,179 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]
[2024-03-09 06:36:58,179 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-09 06:36:58,179 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:36:58,179 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:58,179 INFO  L85        PathProgramCache]: Analyzing trace with hash 135090950, now seen corresponding path program 1 times
[2024-03-09 06:36:58,179 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:58,179 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363293375]
[2024-03-09 06:36:58,180 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:58,180 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:58,188 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:58,223 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-09 06:36:58,223 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:58,223 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363293375]
[2024-03-09 06:36:58,223 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363293375] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:36:58,223 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:36:58,223 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:36:58,223 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831315580]
[2024-03-09 06:36:58,223 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:36:58,224 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 06:36:58,224 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:58,224 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 06:36:58,224 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 06:36:58,263 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 144
[2024-03-09 06:36:58,264 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 149 transitions, 409 flow. Second operand  has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 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-09 06:36:58,264 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:58,264 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 144
[2024-03-09 06:36:58,264 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:58,844 INFO  L124   PetriNetUnfolderBase]: 1392/6677 cut-off events.
[2024-03-09 06:36:58,844 INFO  L125   PetriNetUnfolderBase]: For 426/433 co-relation queries the response was YES.
[2024-03-09 06:36:58,857 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9830 conditions, 6677 events. 1392/6677 cut-off events. For 426/433 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 67410 event pairs, 1078 based on Foata normal form. 1/6031 useless extension candidates. Maximal degree in co-relation 6067. Up to 1835 conditions per place. 
[2024-03-09 06:36:58,871 INFO  L140   encePairwiseOnDemand]: 137/144 looper letters, 24 selfloop transitions, 2 changer transitions 4/152 dead transitions.
[2024-03-09 06:36:58,871 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 152 transitions, 461 flow
[2024-03-09 06:36:58,872 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:36:58,872 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:36:58,873 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 739 transitions.
[2024-03-09 06:36:58,873 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8553240740740741
[2024-03-09 06:36:58,873 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 739 transitions.
[2024-03-09 06:36:58,873 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 739 transitions.
[2024-03-09 06:36:58,874 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:58,874 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 739 transitions.
[2024-03-09 06:36:58,875 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 states have internal predecessors, (739), 0 states have call successors, (0), 0 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-09 06:36:58,876 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 144.0) internal successors, (1008), 7 states have internal predecessors, (1008), 0 states have call successors, (0), 0 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-09 06:36:58,877 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 144.0) internal successors, (1008), 7 states have internal predecessors, (1008), 0 states have call successors, (0), 0 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-09 06:36:58,877 INFO  L175             Difference]: Start difference. First operand has 153 places, 149 transitions, 409 flow. Second operand 6 states and 739 transitions.
[2024-03-09 06:36:58,877 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 152 transitions, 461 flow
[2024-03-09 06:36:58,881 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 152 transitions, 437 flow, removed 7 selfloop flow, removed 2 redundant places.
[2024-03-09 06:36:58,882 INFO  L231             Difference]: Finished difference. Result has 160 places, 146 transitions, 383 flow
[2024-03-09 06:36:58,882 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=383, PETRI_PLACES=160, PETRI_TRANSITIONS=146}
[2024-03-09 06:36:58,882 INFO  L281   CegarLoopForPetriNet]: 145 programPoint places, 15 predicate places.
[2024-03-09 06:36:58,883 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 146 transitions, 383 flow
[2024-03-09 06:36:58,883 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 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-09 06:36:58,883 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:58,883 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]
[2024-03-09 06:36:58,883 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-03-09 06:36:58,883 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:36:58,884 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:58,884 INFO  L85        PathProgramCache]: Analyzing trace with hash 1788876309, now seen corresponding path program 1 times
[2024-03-09 06:36:58,884 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:58,884 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912755703]
[2024-03-09 06:36:58,884 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:58,884 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:58,892 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:36:58,902 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-09 06:36:58,903 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:36:58,903 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912755703]
[2024-03-09 06:36:58,903 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912755703] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:36:58,903 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:36:58,903 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:36:58,903 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163488479]
[2024-03-09 06:36:58,903 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:36:58,903 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:36:58,903 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:36:58,904 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:36:58,904 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:36:58,922 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 144
[2024-03-09 06:36:58,923 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 146 transitions, 383 flow. Second operand  has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 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-09 06:36:58,923 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:36:58,923 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 144
[2024-03-09 06:36:58,923 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:36:59,777 INFO  L124   PetriNetUnfolderBase]: 1718/7427 cut-off events.
[2024-03-09 06:36:59,777 INFO  L125   PetriNetUnfolderBase]: For 1610/4689 co-relation queries the response was YES.
[2024-03-09 06:36:59,791 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12028 conditions, 7427 events. 1718/7427 cut-off events. For 1610/4689 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 79416 event pairs, 957 based on Foata normal form. 7/6582 useless extension candidates. Maximal degree in co-relation 11957. Up to 2225 conditions per place. 
[2024-03-09 06:36:59,808 INFO  L140   encePairwiseOnDemand]: 137/144 looper letters, 29 selfloop transitions, 9 changer transitions 0/161 dead transitions.
[2024-03-09 06:36:59,808 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 161 transitions, 517 flow
[2024-03-09 06:36:59,808 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:36:59,808 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:36:59,809 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions.
[2024-03-09 06:36:59,809 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9189814814814815
[2024-03-09 06:36:59,809 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 397 transitions.
[2024-03-09 06:36:59,809 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions.
[2024-03-09 06:36:59,810 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:36:59,810 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions.
[2024-03-09 06:36:59,810 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 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-09 06:36:59,811 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 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-09 06:36:59,811 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 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-09 06:36:59,811 INFO  L175             Difference]: Start difference. First operand has 160 places, 146 transitions, 383 flow. Second operand 3 states and 397 transitions.
[2024-03-09 06:36:59,811 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 161 transitions, 517 flow
[2024-03-09 06:36:59,815 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 161 transitions, 505 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-09 06:36:59,817 INFO  L231             Difference]: Finished difference. Result has 157 places, 153 transitions, 447 flow
[2024-03-09 06:36:59,817 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=447, PETRI_PLACES=157, PETRI_TRANSITIONS=153}
[2024-03-09 06:36:59,817 INFO  L281   CegarLoopForPetriNet]: 145 programPoint places, 12 predicate places.
[2024-03-09 06:36:59,817 INFO  L495      AbstractCegarLoop]: Abstraction has has 157 places, 153 transitions, 447 flow
[2024-03-09 06:36:59,818 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 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-09 06:36:59,818 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:36:59,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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:36:59,818 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-03-09 06:36:59,818 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:36:59,818 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:36:59,818 INFO  L85        PathProgramCache]: Analyzing trace with hash -842933151, now seen corresponding path program 1 times
[2024-03-09 06:36:59,818 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:36:59,818 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297348779]
[2024-03-09 06:36:59,818 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:36:59,818 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:36:59,829 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:37:00,008 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-09 06:37:00,009 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:37:00,009 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297348779]
[2024-03-09 06:37:00,009 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297348779] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:37:00,009 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:37:00,009 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:37:00,009 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837022835]
[2024-03-09 06:37:00,009 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:37:00,009 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:37:00,009 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:37:00,010 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:37:00,010 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:37:00,141 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 144
[2024-03-09 06:37:00,142 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 153 transitions, 447 flow. Second operand  has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 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-09 06:37:00,142 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:37:00,142 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 144
[2024-03-09 06:37:00,142 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:37:01,054 INFO  L124   PetriNetUnfolderBase]: 2579/9442 cut-off events.
[2024-03-09 06:37:01,055 INFO  L125   PetriNetUnfolderBase]: For 1408/1640 co-relation queries the response was YES.
[2024-03-09 06:37:01,077 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15939 conditions, 9442 events. 2579/9442 cut-off events. For 1408/1640 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 100938 event pairs, 1141 based on Foata normal form. 11/8474 useless extension candidates. Maximal degree in co-relation 13424. Up to 1863 conditions per place. 
[2024-03-09 06:37:01,097 INFO  L140   encePairwiseOnDemand]: 138/144 looper letters, 43 selfloop transitions, 5 changer transitions 0/176 dead transitions.
[2024-03-09 06:37:01,097 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 176 transitions, 589 flow
[2024-03-09 06:37:01,098 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:37:01,098 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:37:01,099 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions.
[2024-03-09 06:37:01,099 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8622685185185185
[2024-03-09 06:37:01,099 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 745 transitions.
[2024-03-09 06:37:01,100 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions.
[2024-03-09 06:37:01,100 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:37:01,100 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions.
[2024-03-09 06:37:01,101 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 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-09 06:37:01,102 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 144.0) internal successors, (1008), 7 states have internal predecessors, (1008), 0 states have call successors, (0), 0 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-09 06:37:01,103 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 144.0) internal successors, (1008), 7 states have internal predecessors, (1008), 0 states have call successors, (0), 0 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-09 06:37:01,103 INFO  L175             Difference]: Start difference. First operand has 157 places, 153 transitions, 447 flow. Second operand 6 states and 745 transitions.
[2024-03-09 06:37:01,103 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 176 transitions, 589 flow
[2024-03-09 06:37:01,109 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 176 transitions, 571 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:37:01,111 INFO  L231             Difference]: Finished difference. Result has 159 places, 152 transitions, 437 flow
[2024-03-09 06:37:01,111 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=437, PETRI_PLACES=159, PETRI_TRANSITIONS=152}
[2024-03-09 06:37:01,111 INFO  L281   CegarLoopForPetriNet]: 145 programPoint places, 14 predicate places.
[2024-03-09 06:37:01,112 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 152 transitions, 437 flow
[2024-03-09 06:37:01,112 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 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-09 06:37:01,112 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:37:01,112 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 06:37:01,113 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-03-09 06:37:01,113 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:37:01,113 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:37:01,113 INFO  L85        PathProgramCache]: Analyzing trace with hash -1925188865, now seen corresponding path program 1 times
[2024-03-09 06:37:01,113 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:37:01,113 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772930201]
[2024-03-09 06:37:01,114 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:37:01,114 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:37:01,125 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:37:01,138 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-03-09 06:37:01,139 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:37:01,139 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772930201]
[2024-03-09 06:37:01,139 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772930201] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:37:01,139 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:37:01,139 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:37:01,139 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102617243]
[2024-03-09 06:37:01,139 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:37:01,140 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:37:01,140 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:37:01,140 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:37:01,140 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:37:01,155 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 144
[2024-03-09 06:37:01,155 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 152 transitions, 437 flow. Second operand  has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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-09 06:37:01,155 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:37:01,155 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 144
[2024-03-09 06:37:01,155 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:37:02,163 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([472] L1031-->L1031-1: Formula: (= |v_#race~data~0_4| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][135], [Black: 159#true, 190#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 167#(= |ULTIMATE.start_main_~i~0#1| 0), 183#true, threadThread3of3ForFork0NotInUse, 90#L1031-1true, Black: 179#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet5|), Black: 148#true, 58#L1016-6true, Black: 151#(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)), 82#L1016-6true, Black: 152#(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: 150#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)])
[2024-03-09 06:37:02,163 INFO  L294   olderBase$Statistics]: this new event has 142 ancestors and is cut-off event
[2024-03-09 06:37:02,164 INFO  L297   olderBase$Statistics]:   existing Event has 93 ancestors and is cut-off event
[2024-03-09 06:37:02,164 INFO  L297   olderBase$Statistics]:   existing Event has 142 ancestors and is cut-off event
[2024-03-09 06:37:02,164 INFO  L297   olderBase$Statistics]:   existing Event has 93 ancestors and is cut-off event
[2024-03-09 06:37:02,275 INFO  L124   PetriNetUnfolderBase]: 2766/10908 cut-off events.
[2024-03-09 06:37:02,275 INFO  L125   PetriNetUnfolderBase]: For 5311/14831 co-relation queries the response was YES.
[2024-03-09 06:37:02,316 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20319 conditions, 10908 events. 2766/10908 cut-off events. For 5311/14831 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 124958 event pairs, 1254 based on Foata normal form. 10/9660 useless extension candidates. Maximal degree in co-relation 17805. Up to 3354 conditions per place. 
[2024-03-09 06:37:02,349 INFO  L140   encePairwiseOnDemand]: 137/144 looper letters, 31 selfloop transitions, 14 changer transitions 0/169 dead transitions.
[2024-03-09 06:37:02,349 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 169 transitions, 606 flow
[2024-03-09 06:37:02,350 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:37:02,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:37:02,351 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions.
[2024-03-09 06:37:02,352 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9166666666666666
[2024-03-09 06:37:02,352 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 396 transitions.
[2024-03-09 06:37:02,352 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions.
[2024-03-09 06:37:02,353 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:37:02,353 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions.
[2024-03-09 06:37:02,354 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 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-09 06:37:02,355 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 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-09 06:37:02,355 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 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-09 06:37:02,355 INFO  L175             Difference]: Start difference. First operand has 159 places, 152 transitions, 437 flow. Second operand 3 states and 396 transitions.
[2024-03-09 06:37:02,355 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 169 transitions, 606 flow
[2024-03-09 06:37:02,370 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 169 transitions, 596 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-09 06:37:02,372 INFO  L231             Difference]: Finished difference. Result has 158 places, 162 transitions, 557 flow
[2024-03-09 06:37:02,372 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=557, PETRI_PLACES=158, PETRI_TRANSITIONS=162}
[2024-03-09 06:37:02,372 INFO  L281   CegarLoopForPetriNet]: 145 programPoint places, 13 predicate places.
[2024-03-09 06:37:02,372 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 162 transitions, 557 flow
[2024-03-09 06:37:02,373 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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-09 06:37:02,373 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:37:02,373 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]
[2024-03-09 06:37:02,373 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-03-09 06:37:02,373 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:37:02,374 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:37:02,374 INFO  L85        PathProgramCache]: Analyzing trace with hash 1420087469, now seen corresponding path program 1 times
[2024-03-09 06:37:02,374 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:37:02,374 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651195732]
[2024-03-09 06:37:02,374 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:37:02,375 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:37:02,387 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:37:02,459 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-09 06:37:02,460 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:37:02,460 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651195732]
[2024-03-09 06:37:02,460 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651195732] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:37:02,460 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889681868]
[2024-03-09 06:37:02,460 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:37:02,460 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:37:02,461 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:37:02,461 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-09 06:37:02,466 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-09 06:37:02,590 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:37:02,591 INFO  L262         TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-09 06:37:02,592 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:37:02,658 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-09 06:37:02,659 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:37:02,702 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-09 06:37:02,703 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [889681868] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:37:02,703 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:37:02,703 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9
[2024-03-09 06:37:02,703 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592276327]
[2024-03-09 06:37:02,703 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:37:02,704 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-09 06:37:02,704 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:37:02,704 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-09 06:37:02,704 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-09 06:37:02,789 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 144
[2024-03-09 06:37:02,790 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 162 transitions, 557 flow. Second operand  has 9 states, 9 states have (on average 118.33333333333333) internal successors, (1065), 9 states have internal predecessors, (1065), 0 states have call successors, (0), 0 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-09 06:37:02,790 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:37:02,790 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 144
[2024-03-09 06:37:02,790 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:37:03,856 INFO  L124   PetriNetUnfolderBase]: 2028/10252 cut-off events.
[2024-03-09 06:37:03,856 INFO  L125   PetriNetUnfolderBase]: For 3359/3850 co-relation queries the response was YES.
[2024-03-09 06:37:03,894 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17145 conditions, 10252 events. 2028/10252 cut-off events. For 3359/3850 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 115719 event pairs, 702 based on Foata normal form. 5/9494 useless extension candidates. Maximal degree in co-relation 12275. Up to 1342 conditions per place. 
[2024-03-09 06:37:03,921 INFO  L140   encePairwiseOnDemand]: 134/144 looper letters, 48 selfloop transitions, 10 changer transitions 0/193 dead transitions.
[2024-03-09 06:37:03,922 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 193 transitions, 736 flow
[2024-03-09 06:37:03,922 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-03-09 06:37:03,922 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-03-09 06:37:03,924 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 987 transitions.
[2024-03-09 06:37:03,924 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8567708333333334
[2024-03-09 06:37:03,924 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 987 transitions.
[2024-03-09 06:37:03,925 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 987 transitions.
[2024-03-09 06:37:03,925 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:37:03,925 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 987 transitions.
[2024-03-09 06:37:03,927 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 123.375) internal successors, (987), 8 states have internal predecessors, (987), 0 states have call successors, (0), 0 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-09 06:37:03,928 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 144.0) internal successors, (1296), 9 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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-09 06:37:03,929 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 144.0) internal successors, (1296), 9 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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-09 06:37:03,929 INFO  L175             Difference]: Start difference. First operand has 158 places, 162 transitions, 557 flow. Second operand 8 states and 987 transitions.
[2024-03-09 06:37:03,929 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 193 transitions, 736 flow
[2024-03-09 06:37:03,938 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 193 transitions, 710 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:37:03,940 INFO  L231             Difference]: Finished difference. Result has 166 places, 164 transitions, 565 flow
[2024-03-09 06:37:03,941 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=565, PETRI_PLACES=166, PETRI_TRANSITIONS=164}
[2024-03-09 06:37:03,941 INFO  L281   CegarLoopForPetriNet]: 145 programPoint places, 21 predicate places.
[2024-03-09 06:37:03,941 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 164 transitions, 565 flow
[2024-03-09 06:37:03,942 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 118.33333333333333) internal successors, (1065), 9 states have internal predecessors, (1065), 0 states have call successors, (0), 0 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-09 06:37:03,942 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:37:03,942 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 06:37:03,949 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-09 06:37:04,143 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,SelfDestructingSolverStorable19
[2024-03-09 06:37:04,144 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:37:04,145 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:37:04,145 INFO  L85        PathProgramCache]: Analyzing trace with hash 955137299, now seen corresponding path program 1 times
[2024-03-09 06:37:04,145 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:37:04,146 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631245358]
[2024-03-09 06:37:04,146 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:37:04,146 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:37:04,163 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:37:04,218 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:37:04,218 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:37:04,218 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631245358]
[2024-03-09 06:37:04,218 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631245358] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:37:04,218 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:37:04,219 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-09 06:37:04,219 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876301103]
[2024-03-09 06:37:04,219 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:37:04,219 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:37:04,219 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:37:04,220 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:37:04,220 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:37:04,231 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 144
[2024-03-09 06:37:04,232 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 164 transitions, 565 flow. Second operand  has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 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-09 06:37:04,232 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:37:04,232 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 144
[2024-03-09 06:37:04,232 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:37:04,459 INFO  L124   PetriNetUnfolderBase]: 117/1870 cut-off events.
[2024-03-09 06:37:04,459 INFO  L125   PetriNetUnfolderBase]: For 622/801 co-relation queries the response was YES.
[2024-03-09 06:37:04,466 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3071 conditions, 1870 events. 117/1870 cut-off events. For 622/801 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 15568 event pairs, 43 based on Foata normal form. 24/1814 useless extension candidates. Maximal degree in co-relation 2427. Up to 144 conditions per place. 
[2024-03-09 06:37:04,469 INFO  L140   encePairwiseOnDemand]: 138/144 looper letters, 12 selfloop transitions, 6 changer transitions 0/159 dead transitions.
[2024-03-09 06:37:04,469 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 159 transitions, 552 flow
[2024-03-09 06:37:04,470 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:37:04,470 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:37:04,471 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions.
[2024-03-09 06:37:04,471 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9375
[2024-03-09 06:37:04,471 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 405 transitions.
[2024-03-09 06:37:04,471 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions.
[2024-03-09 06:37:04,472 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:37:04,472 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions.
[2024-03-09 06:37:04,473 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 06:37:04,473 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 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-09 06:37:04,474 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 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-09 06:37:04,474 INFO  L175             Difference]: Start difference. First operand has 166 places, 164 transitions, 565 flow. Second operand 3 states and 405 transitions.
[2024-03-09 06:37:04,474 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 159 transitions, 552 flow
[2024-03-09 06:37:04,477 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 159 transitions, 542 flow, removed 2 selfloop flow, removed 3 redundant places.
[2024-03-09 06:37:04,478 INFO  L231             Difference]: Finished difference. Result has 165 places, 154 transitions, 487 flow
[2024-03-09 06:37:04,478 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=165, PETRI_TRANSITIONS=154}
[2024-03-09 06:37:04,479 INFO  L281   CegarLoopForPetriNet]: 145 programPoint places, 20 predicate places.
[2024-03-09 06:37:04,479 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 154 transitions, 487 flow
[2024-03-09 06:37:04,479 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 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-09 06:37:04,480 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:37:04,480 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-03-09 06:37:04,480 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-03-09 06:37:04,480 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:37:04,480 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:37:04,480 INFO  L85        PathProgramCache]: Analyzing trace with hash -2095388076, now seen corresponding path program 1 times
[2024-03-09 06:37:04,481 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:37:04,481 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932675530]
[2024-03-09 06:37:04,481 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:37:04,481 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:37:04,500 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:37:04,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked.
[2024-03-09 06:37:04,520 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:37:04,521 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932675530]
[2024-03-09 06:37:04,521 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932675530] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:37:04,521 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:37:04,521 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:37:04,521 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567190474]
[2024-03-09 06:37:04,521 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:37:04,522 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:37:04,522 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:37:04,522 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:37:04,522 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:37:04,538 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 144
[2024-03-09 06:37:04,539 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 154 transitions, 487 flow. Second operand  has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 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-09 06:37:04,539 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:37:04,539 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 144
[2024-03-09 06:37:04,539 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:37:04,790 INFO  L124   PetriNetUnfolderBase]: 203/2177 cut-off events.
[2024-03-09 06:37:04,791 INFO  L125   PetriNetUnfolderBase]: For 1399/1861 co-relation queries the response was YES.
[2024-03-09 06:37:04,795 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3967 conditions, 2177 events. 203/2177 cut-off events. For 1399/1861 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 19434 event pairs, 134 based on Foata normal form. 4/2041 useless extension candidates. Maximal degree in co-relation 3265. Up to 435 conditions per place. 
[2024-03-09 06:37:04,796 INFO  L140   encePairwiseOnDemand]: 139/144 looper letters, 25 selfloop transitions, 5 changer transitions 0/159 dead transitions.
[2024-03-09 06:37:04,797 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 159 transitions, 569 flow
[2024-03-09 06:37:04,797 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:37:04,797 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:37:04,798 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions.
[2024-03-09 06:37:04,798 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9004629629629629
[2024-03-09 06:37:04,798 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 389 transitions.
[2024-03-09 06:37:04,798 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions.
[2024-03-09 06:37:04,798 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:37:04,799 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions.
[2024-03-09 06:37:04,799 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 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-09 06:37:04,800 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 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-09 06:37:04,800 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 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-09 06:37:04,800 INFO  L175             Difference]: Start difference. First operand has 165 places, 154 transitions, 487 flow. Second operand 3 states and 389 transitions.
[2024-03-09 06:37:04,800 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 159 transitions, 569 flow
[2024-03-09 06:37:04,803 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 159 transitions, 563 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 06:37:04,805 INFO  L231             Difference]: Finished difference. Result has 168 places, 157 transitions, 521 flow
[2024-03-09 06:37:04,805 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=521, PETRI_PLACES=168, PETRI_TRANSITIONS=157}
[2024-03-09 06:37:04,805 INFO  L281   CegarLoopForPetriNet]: 145 programPoint places, 23 predicate places.
[2024-03-09 06:37:04,805 INFO  L495      AbstractCegarLoop]: Abstraction has has 168 places, 157 transitions, 521 flow
[2024-03-09 06:37:04,806 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 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-09 06:37:04,806 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:37:04,806 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-09 06:37:04,806 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-03-09 06:37:04,806 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-09 06:37:04,807 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:37:04,807 INFO  L85        PathProgramCache]: Analyzing trace with hash -1118551274, now seen corresponding path program 1 times
[2024-03-09 06:37:04,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:37:04,807 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746360950]
[2024-03-09 06:37:04,807 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:37:04,807 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:37:04,829 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:37:04,829 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 06:37:04,840 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:37:04,849 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 06:37:04,849 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 06:37:04,849 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining)
[2024-03-09 06:37:04,849 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining)
[2024-03-09 06:37:04,850 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining)
[2024-03-09 06:37:04,850 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining)
[2024-03-09 06:37:04,850 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining)
[2024-03-09 06:37:04,850 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining)
[2024-03-09 06:37:04,850 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining)
[2024-03-09 06:37:04,850 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining)
[2024-03-09 06:37:04,850 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining)
[2024-03-09 06:37:04,851 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining)
[2024-03-09 06:37:04,851 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-03-09 06:37:04,851 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:37:04,851 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 06:37:04,852 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2024-03-09 06:37:04,867 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2024-03-09 06:37:04,868 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 164 places, 162 transitions, 364 flow
[2024-03-09 06:37:04,934 INFO  L124   PetriNetUnfolderBase]: 43/850 cut-off events.
[2024-03-09 06:37:04,935 INFO  L125   PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES.
[2024-03-09 06:37:04,936 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 901 conditions, 850 events. 43/850 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3404 event pairs, 6 based on Foata normal form. 0/734 useless extension candidates. Maximal degree in co-relation 500. Up to 32 conditions per place. 
[2024-03-09 06:37:04,937 INFO  L82        GeneralOperation]: Start removeDead. Operand has 164 places, 162 transitions, 364 flow
[2024-03-09 06:37:04,939 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 164 places, 162 transitions, 364 flow
[2024-03-09 06:37:04,940 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 06:37:04,940 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;@7eae7aed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 06:37:04,940 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2024-03-09 06:37:04,942 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 06:37:04,942 INFO  L124   PetriNetUnfolderBase]: 3/52 cut-off events.
[2024-03-09 06:37:04,942 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 06:37:04,942 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:37:04,942 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]
[2024-03-09 06:37:04,943 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:37:04,943 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:37:04,943 INFO  L85        PathProgramCache]: Analyzing trace with hash 1054184613, now seen corresponding path program 1 times
[2024-03-09 06:37:04,943 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:37:04,943 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655417393]
[2024-03-09 06:37:04,943 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:37:04,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:37:04,950 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:37:05,059 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-09 06:37:05,059 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:37:05,059 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655417393]
[2024-03-09 06:37:05,059 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655417393] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:37:05,059 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:37:05,059 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:37:05,060 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037063471]
[2024-03-09 06:37:05,060 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:37:05,060 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:37:05,060 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:37:05,060 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:37:05,061 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:37:05,175 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 162
[2024-03-09 06:37:05,176 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 162 transitions, 364 flow. Second operand  has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 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-09 06:37:05,177 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:37:05,177 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 162
[2024-03-09 06:37:05,177 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:37:08,209 INFO  L124   PetriNetUnfolderBase]: 8218/33014 cut-off events.
[2024-03-09 06:37:08,209 INFO  L125   PetriNetUnfolderBase]: For 1120/1120 co-relation queries the response was YES.
[2024-03-09 06:37:08,279 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45649 conditions, 33014 events. 8218/33014 cut-off events. For 1120/1120 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 425503 event pairs, 7076 based on Foata normal form. 312/30786 useless extension candidates. Maximal degree in co-relation 14886. Up to 10644 conditions per place. 
[2024-03-09 06:37:08,369 INFO  L140   encePairwiseOnDemand]: 143/162 looper letters, 42 selfloop transitions, 13 changer transitions 1/176 dead transitions.
[2024-03-09 06:37:08,370 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 176 transitions, 502 flow
[2024-03-09 06:37:08,370 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:37:08,371 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:37:08,372 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 789 transitions.
[2024-03-09 06:37:08,372 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8117283950617284
[2024-03-09 06:37:08,372 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 789 transitions.
[2024-03-09 06:37:08,372 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 789 transitions.
[2024-03-09 06:37:08,373 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:37:08,373 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 789 transitions.
[2024-03-09 06:37:08,374 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 0 states have call successors, (0), 0 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-09 06:37:08,375 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 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-09 06:37:08,375 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 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-09 06:37:08,375 INFO  L175             Difference]: Start difference. First operand has 164 places, 162 transitions, 364 flow. Second operand 6 states and 789 transitions.
[2024-03-09 06:37:08,375 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 176 transitions, 502 flow
[2024-03-09 06:37:08,378 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 176 transitions, 502 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:37:08,379 INFO  L231             Difference]: Finished difference. Result has 170 places, 167 transitions, 446 flow
[2024-03-09 06:37:08,379 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=170, PETRI_TRANSITIONS=167}
[2024-03-09 06:37:08,380 INFO  L281   CegarLoopForPetriNet]: 164 programPoint places, 6 predicate places.
[2024-03-09 06:37:08,380 INFO  L495      AbstractCegarLoop]: Abstraction has has 170 places, 167 transitions, 446 flow
[2024-03-09 06:37:08,380 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 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-09 06:37:08,380 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:37:08,380 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]
[2024-03-09 06:37:08,380 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-03-09 06:37:08,380 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:37:08,381 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:37:08,381 INFO  L85        PathProgramCache]: Analyzing trace with hash 96302809, now seen corresponding path program 1 times
[2024-03-09 06:37:08,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:37:08,381 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707992405]
[2024-03-09 06:37:08,381 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:37:08,381 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:37:08,389 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:37:08,402 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-09 06:37:08,402 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:37:08,402 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707992405]
[2024-03-09 06:37:08,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707992405] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:37:08,403 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:37:08,403 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:37:08,403 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20706283]
[2024-03-09 06:37:08,403 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:37:08,403 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:37:08,403 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:37:08,404 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:37:08,404 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:37:08,422 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 162
[2024-03-09 06:37:08,422 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 167 transitions, 446 flow. Second operand  has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 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-09 06:37:08,422 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:37:08,423 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 162
[2024-03-09 06:37:08,423 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:37:11,386 INFO  L124   PetriNetUnfolderBase]: 7860/26678 cut-off events.
[2024-03-09 06:37:11,386 INFO  L125   PetriNetUnfolderBase]: For 3044/5238 co-relation queries the response was YES.
[2024-03-09 06:37:11,459 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40953 conditions, 26678 events. 7860/26678 cut-off events. For 3044/5238 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 321403 event pairs, 4292 based on Foata normal form. 0/24271 useless extension candidates. Maximal degree in co-relation 37726. Up to 7653 conditions per place. 
[2024-03-09 06:37:11,542 INFO  L140   encePairwiseOnDemand]: 155/162 looper letters, 30 selfloop transitions, 6 changer transitions 4/180 dead transitions.
[2024-03-09 06:37:11,542 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 180 transitions, 544 flow
[2024-03-09 06:37:11,543 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:37:11,543 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:37:11,544 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions.
[2024-03-09 06:37:11,544 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9156378600823045
[2024-03-09 06:37:11,544 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 445 transitions.
[2024-03-09 06:37:11,544 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions.
[2024-03-09 06:37:11,544 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:37:11,544 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions.
[2024-03-09 06:37:11,545 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 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-09 06:37:11,546 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 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-09 06:37:11,546 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 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-09 06:37:11,546 INFO  L175             Difference]: Start difference. First operand has 170 places, 167 transitions, 446 flow. Second operand 3 states and 445 transitions.
[2024-03-09 06:37:11,546 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 180 transitions, 544 flow
[2024-03-09 06:37:11,649 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 180 transitions, 540 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 06:37:11,650 INFO  L231             Difference]: Finished difference. Result has 172 places, 168 transitions, 466 flow
[2024-03-09 06:37:11,651 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=172, PETRI_TRANSITIONS=168}
[2024-03-09 06:37:11,651 INFO  L281   CegarLoopForPetriNet]: 164 programPoint places, 8 predicate places.
[2024-03-09 06:37:11,651 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 168 transitions, 466 flow
[2024-03-09 06:37:11,651 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 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-09 06:37:11,651 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:37:11,652 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]
[2024-03-09 06:37:11,652 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-03-09 06:37:11,652 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:37:11,652 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:37:11,652 INFO  L85        PathProgramCache]: Analyzing trace with hash -1962282392, now seen corresponding path program 1 times
[2024-03-09 06:37:11,652 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:37:11,652 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918398710]
[2024-03-09 06:37:11,652 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:37:11,653 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:37:11,663 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:37:11,704 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-09 06:37:11,704 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:37:11,704 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918398710]
[2024-03-09 06:37:11,704 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918398710] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:37:11,704 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:37:11,705 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:37:11,705 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344461690]
[2024-03-09 06:37:11,705 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:37:11,705 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 06:37:11,705 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:37:11,705 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 06:37:11,706 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 06:37:11,742 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 162
[2024-03-09 06:37:11,743 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 168 transitions, 466 flow. Second operand  has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 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-09 06:37:11,743 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:37:11,743 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 162
[2024-03-09 06:37:11,743 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:37:15,195 INFO  L124   PetriNetUnfolderBase]: 8759/34260 cut-off events.
[2024-03-09 06:37:15,195 INFO  L125   PetriNetUnfolderBase]: For 2360/2360 co-relation queries the response was YES.
[2024-03-09 06:37:15,307 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51610 conditions, 34260 events. 8759/34260 cut-off events. For 2360/2360 co-relation queries the response was YES. Maximal size of possible extension queue 795. Compared 439141 event pairs, 5733 based on Foata normal form. 1/29895 useless extension candidates. Maximal degree in co-relation 29068. Up to 9813 conditions per place. 
[2024-03-09 06:37:15,410 INFO  L140   encePairwiseOnDemand]: 155/162 looper letters, 28 selfloop transitions, 2 changer transitions 4/171 dead transitions.
[2024-03-09 06:37:15,411 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 171 transitions, 526 flow
[2024-03-09 06:37:15,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:37:15,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:37:15,412 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 827 transitions.
[2024-03-09 06:37:15,413 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8508230452674898
[2024-03-09 06:37:15,413 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 827 transitions.
[2024-03-09 06:37:15,413 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 827 transitions.
[2024-03-09 06:37:15,413 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:37:15,413 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 827 transitions.
[2024-03-09 06:37:15,414 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 137.83333333333334) internal successors, (827), 6 states have internal predecessors, (827), 0 states have call successors, (0), 0 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-09 06:37:15,415 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 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-09 06:37:15,415 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 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-09 06:37:15,415 INFO  L175             Difference]: Start difference. First operand has 172 places, 168 transitions, 466 flow. Second operand 6 states and 827 transitions.
[2024-03-09 06:37:15,415 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 171 transitions, 526 flow
[2024-03-09 06:37:15,471 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 171 transitions, 500 flow, removed 7 selfloop flow, removed 2 redundant places.
[2024-03-09 06:37:15,472 INFO  L231             Difference]: Finished difference. Result has 179 places, 165 transitions, 438 flow
[2024-03-09 06:37:15,472 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=438, PETRI_PLACES=179, PETRI_TRANSITIONS=165}
[2024-03-09 06:37:15,473 INFO  L281   CegarLoopForPetriNet]: 164 programPoint places, 15 predicate places.
[2024-03-09 06:37:15,473 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 165 transitions, 438 flow
[2024-03-09 06:37:15,473 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 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-09 06:37:15,473 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:37:15,473 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]
[2024-03-09 06:37:15,473 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-03-09 06:37:15,473 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:37:15,474 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:37:15,474 INFO  L85        PathProgramCache]: Analyzing trace with hash -309762345, now seen corresponding path program 1 times
[2024-03-09 06:37:15,474 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:37:15,474 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492827268]
[2024-03-09 06:37:15,474 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:37:15,474 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:37:15,482 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:37:15,492 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-09 06:37:15,493 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:37:15,493 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492827268]
[2024-03-09 06:37:15,493 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492827268] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:37:15,493 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:37:15,493 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:37:15,493 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904891293]
[2024-03-09 06:37:15,493 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:37:15,493 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:37:15,493 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:37:15,494 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:37:15,494 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:37:15,515 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 134 out of 162
[2024-03-09 06:37:15,515 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 165 transitions, 438 flow. Second operand  has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 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-09 06:37:15,515 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:37:15,515 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 162
[2024-03-09 06:37:15,515 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:37:21,132 INFO  L124   PetriNetUnfolderBase]: 13502/49384 cut-off events.
[2024-03-09 06:37:21,132 INFO  L125   PetriNetUnfolderBase]: For 10681/24651 co-relation queries the response was YES.
[2024-03-09 06:37:21,311 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 80529 conditions, 49384 events. 13502/49384 cut-off events. For 10681/24651 co-relation queries the response was YES. Maximal size of possible extension queue 1605. Compared 676480 event pairs, 7306 based on Foata normal form. 31/43983 useless extension candidates. Maximal degree in co-relation 80457. Up to 15734 conditions per place. 
[2024-03-09 06:37:21,479 INFO  L140   encePairwiseOnDemand]: 154/162 looper letters, 39 selfloop transitions, 11 changer transitions 0/186 dead transitions.
[2024-03-09 06:37:21,480 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 186 transitions, 624 flow
[2024-03-09 06:37:21,480 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:37:21,481 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:37:21,481 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions.
[2024-03-09 06:37:21,481 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9176954732510288
[2024-03-09 06:37:21,481 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 446 transitions.
[2024-03-09 06:37:21,481 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions.
[2024-03-09 06:37:21,482 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:37:21,482 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions.
[2024-03-09 06:37:21,482 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 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-09 06:37:21,483 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 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-09 06:37:21,483 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 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-09 06:37:21,483 INFO  L175             Difference]: Start difference. First operand has 179 places, 165 transitions, 438 flow. Second operand 3 states and 446 transitions.
[2024-03-09 06:37:21,483 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 186 transitions, 624 flow
[2024-03-09 06:37:21,519 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 186 transitions, 612 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-09 06:37:21,521 INFO  L231             Difference]: Finished difference. Result has 176 places, 174 transitions, 522 flow
[2024-03-09 06:37:21,521 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=522, PETRI_PLACES=176, PETRI_TRANSITIONS=174}
[2024-03-09 06:37:21,521 INFO  L281   CegarLoopForPetriNet]: 164 programPoint places, 12 predicate places.
[2024-03-09 06:37:21,521 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 174 transitions, 522 flow
[2024-03-09 06:37:21,521 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 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-09 06:37:21,521 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:37:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:37:21,522 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-03-09 06:37:21,522 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:37:21,522 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:37:21,522 INFO  L85        PathProgramCache]: Analyzing trace with hash -111763471, now seen corresponding path program 1 times
[2024-03-09 06:37:21,522 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:37:21,522 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263315079]
[2024-03-09 06:37:21,522 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:37:21,523 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:37:21,541 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:37:21,737 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-09 06:37:21,737 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:37:21,738 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263315079]
[2024-03-09 06:37:21,738 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263315079] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:37:21,738 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:37:21,738 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:37:21,738 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855210415]
[2024-03-09 06:37:21,738 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:37:21,738 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:37:21,738 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:37:21,739 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:37:21,739 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:37:21,917 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 130 out of 162
[2024-03-09 06:37:21,918 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 174 transitions, 522 flow. Second operand  has 6 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 0 states have call successors, (0), 0 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-09 06:37:21,918 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:37:21,918 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 162
[2024-03-09 06:37:21,918 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:37:26,322 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([685] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread3of4ForFork0_#t~nondet5_3|)  InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][172], [threadThread2of4ForFork0InUse, Black: 186#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 80#L1015-3true, 102#L1031-2true, Black: 171#(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: 170#(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: 169#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 167#true, 85#L1016-5true, Black: 180#(= |#race~data~0| 0), 103#L1017true, 196#true, 202#true, threadThread1of4ForFork0InUse])
[2024-03-09 06:37:26,322 INFO  L294   olderBase$Statistics]: this new event has 163 ancestors and is cut-off event
[2024-03-09 06:37:26,322 INFO  L297   olderBase$Statistics]:   existing Event has 163 ancestors and is cut-off event
[2024-03-09 06:37:26,322 INFO  L297   olderBase$Statistics]:   existing Event has 114 ancestors and is cut-off event
[2024-03-09 06:37:26,322 INFO  L297   olderBase$Statistics]:   existing Event has 114 ancestors and is cut-off event
[2024-03-09 06:37:26,616 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][203], [threadThread2of4ForFork0NotInUse, Black: 186#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 102#L1031-2true, 54#L1016-5true, Black: 171#(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: 170#(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: 169#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 167#true, 90#L1016-6true, Black: 180#(= |#race~data~0| 0), 85#L1016-5true, 196#true, 202#true, threadThread1of4ForFork0InUse])
[2024-03-09 06:37:26,616 INFO  L294   olderBase$Statistics]: this new event has 167 ancestors and is cut-off event
[2024-03-09 06:37:26,617 INFO  L297   olderBase$Statistics]:   existing Event has 167 ancestors and is cut-off event
[2024-03-09 06:37:26,617 INFO  L297   olderBase$Statistics]:   existing Event has 167 ancestors and is cut-off event
[2024-03-09 06:37:26,617 INFO  L297   olderBase$Statistics]:   existing Event has 167 ancestors and is cut-off event
[2024-03-09 06:37:26,807 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([685] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread3of4ForFork0_#t~nondet5_3|)  InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][172], [threadThread2of4ForFork0InUse, Black: 186#(= |ULTIMATE.start_main_~i~0#1| 0), 18#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 102#L1031-2true, Black: 171#(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: 170#(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: 169#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 51#L1016-5true, Black: 167#true, Black: 180#(= |#race~data~0| 0), 85#L1016-5true, 196#true, 202#true, threadThread1of4ForFork0InUse])
[2024-03-09 06:37:26,808 INFO  L294   olderBase$Statistics]: this new event has 167 ancestors and is cut-off event
[2024-03-09 06:37:26,808 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-03-09 06:37:26,808 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-03-09 06:37:26,808 INFO  L297   olderBase$Statistics]:   existing Event has 167 ancestors and is cut-off event
[2024-03-09 06:37:26,940 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][197], [threadThread2of4ForFork0NotInUse, Black: 186#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 102#L1031-2true, 54#L1016-5true, Black: 171#(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: 170#(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: 169#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 167#true, 85#L1016-5true, Black: 180#(= |#race~data~0| 0), 103#L1017true, 196#true, 202#true, threadThread1of4ForFork0InUse])
[2024-03-09 06:37:26,940 INFO  L294   olderBase$Statistics]: this new event has 169 ancestors and is cut-off event
[2024-03-09 06:37:26,940 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-09 06:37:26,940 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-09 06:37:26,941 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-09 06:37:27,929 INFO  L124   PetriNetUnfolderBase]: 18702/55132 cut-off events.
[2024-03-09 06:37:27,930 INFO  L125   PetriNetUnfolderBase]: For 8421/10497 co-relation queries the response was YES.
[2024-03-09 06:37:28,169 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 95577 conditions, 55132 events. 18702/55132 cut-off events. For 8421/10497 co-relation queries the response was YES. Maximal size of possible extension queue 1680. Compared 715193 event pairs, 8573 based on Foata normal form. 160/48912 useless extension candidates. Maximal degree in co-relation 80271. Up to 11744 conditions per place. 
[2024-03-09 06:37:28,382 INFO  L140   encePairwiseOnDemand]: 156/162 looper letters, 55 selfloop transitions, 5 changer transitions 0/205 dead transitions.
[2024-03-09 06:37:28,382 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 205 transitions, 704 flow
[2024-03-09 06:37:28,382 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:37:28,383 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:37:28,383 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 841 transitions.
[2024-03-09 06:37:28,384 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8652263374485597
[2024-03-09 06:37:28,384 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 841 transitions.
[2024-03-09 06:37:28,384 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 841 transitions.
[2024-03-09 06:37:28,384 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:37:28,384 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 841 transitions.
[2024-03-09 06:37:28,385 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 140.16666666666666) internal successors, (841), 6 states have internal predecessors, (841), 0 states have call successors, (0), 0 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-09 06:37:28,386 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 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-09 06:37:28,387 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 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-09 06:37:28,387 INFO  L175             Difference]: Start difference. First operand has 176 places, 174 transitions, 522 flow. Second operand 6 states and 841 transitions.
[2024-03-09 06:37:28,387 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 205 transitions, 704 flow
[2024-03-09 06:37:28,478 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 205 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:37:28,480 INFO  L231             Difference]: Finished difference. Result has 178 places, 173 transitions, 508 flow
[2024-03-09 06:37:28,480 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=508, PETRI_PLACES=178, PETRI_TRANSITIONS=173}
[2024-03-09 06:37:28,481 INFO  L281   CegarLoopForPetriNet]: 164 programPoint places, 14 predicate places.
[2024-03-09 06:37:28,481 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 173 transitions, 508 flow
[2024-03-09 06:37:28,481 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 0 states have call successors, (0), 0 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-09 06:37:28,481 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:37:28,481 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 06:37:28,482 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-03-09 06:37:28,482 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:37:28,482 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:37:28,482 INFO  L85        PathProgramCache]: Analyzing trace with hash 75469071, now seen corresponding path program 1 times
[2024-03-09 06:37:28,482 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:37:28,482 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22090952]
[2024-03-09 06:37:28,482 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:37:28,482 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:37:28,494 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:37:28,508 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-03-09 06:37:28,508 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:37:28,508 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22090952]
[2024-03-09 06:37:28,509 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22090952] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:37:28,509 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:37:28,509 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:37:28,509 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258299812]
[2024-03-09 06:37:28,509 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:37:28,509 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:37:28,509 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:37:28,510 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:37:28,510 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:37:28,527 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 134 out of 162
[2024-03-09 06:37:28,528 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 173 transitions, 508 flow. Second operand  has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 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-09 06:37:28,528 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:37:28,528 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 162
[2024-03-09 06:37:28,528 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:37:32,593 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([634] L1031-->L1031-1: Formula: (= |v_#race~data~0_4| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][135], [Black: 186#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, 42#L1016-6true, threadThread4of4ForFork0NotInUse, 99#L1031-1true, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 171#(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)), 209#true, Black: 170#(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: 169#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 167#true, 90#L1016-6true, Black: 178#true, 202#true, threadThread1of4ForFork0InUse])
[2024-03-09 06:37:32,593 INFO  L294   olderBase$Statistics]: this new event has 142 ancestors and is cut-off event
[2024-03-09 06:37:32,593 INFO  L297   olderBase$Statistics]:   existing Event has 93 ancestors and is cut-off event
[2024-03-09 06:37:32,593 INFO  L297   olderBase$Statistics]:   existing Event has 93 ancestors and is cut-off event
[2024-03-09 06:37:32,593 INFO  L297   olderBase$Statistics]:   existing Event has 142 ancestors and is cut-off event
[2024-03-09 06:37:32,834 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][193], [threadThread2of4ForFork0InUse, Black: 186#(= |ULTIMATE.start_main_~i~0#1| 0), 42#L1016-6true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 54#L1016-5true, 209#true, Black: 171#(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: 170#(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: 169#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 167#true, 90#L1016-6true, 85#L1016-5true, Black: 180#(= |#race~data~0| 0), 35#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, 202#true, threadThread1of4ForFork0InUse])
[2024-03-09 06:37:32,834 INFO  L294   olderBase$Statistics]: this new event has 144 ancestors and is cut-off event
[2024-03-09 06:37:32,834 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is cut-off event
[2024-03-09 06:37:32,834 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is cut-off event
[2024-03-09 06:37:32,835 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is cut-off event
[2024-03-09 06:37:33,378 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][186], [threadThread2of4ForFork0InUse, Black: 186#(= |ULTIMATE.start_main_~i~0#1| 0), 42#L1016-6true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 54#L1016-5true, 209#true, Black: 171#(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: 170#(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: 169#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 167#true, Black: 180#(= |#race~data~0| 0), 85#L1016-5true, 35#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, 103#L1017true, 202#true, threadThread1of4ForFork0InUse])
[2024-03-09 06:37:33,379 INFO  L294   olderBase$Statistics]: this new event has 146 ancestors and is cut-off event
[2024-03-09 06:37:33,379 INFO  L297   olderBase$Statistics]:   existing Event has 146 ancestors and is cut-off event
[2024-03-09 06:37:33,379 INFO  L297   olderBase$Statistics]:   existing Event has 146 ancestors and is cut-off event
[2024-03-09 06:37:33,379 INFO  L297   olderBase$Statistics]:   existing Event has 146 ancestors and is cut-off event
[2024-03-09 06:37:33,590 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][193], [threadThread2of4ForFork0InUse, Black: 186#(= |ULTIMATE.start_main_~i~0#1| 0), 42#L1016-6true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 54#L1016-5true, 209#true, Black: 171#(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: 170#(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: 169#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 167#true, 90#L1016-6true, 49#L1017-3true, Black: 180#(= |#race~data~0| 0), 35#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, 202#true, threadThread1of4ForFork0InUse])
[2024-03-09 06:37:33,590 INFO  L294   olderBase$Statistics]: this new event has 148 ancestors and is cut-off event
[2024-03-09 06:37:33,590 INFO  L297   olderBase$Statistics]:   existing Event has 148 ancestors and is cut-off event
[2024-03-09 06:37:33,590 INFO  L297   olderBase$Statistics]:   existing Event has 148 ancestors and is cut-off event
[2024-03-09 06:37:33,590 INFO  L297   olderBase$Statistics]:   existing Event has 148 ancestors and is cut-off event
[2024-03-09 06:37:34,025 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][173], [threadThread2of4ForFork0InUse, Black: 186#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of4ForFork0InUse, 18#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread4of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 157#L1017true, 54#L1016-5true, Black: 171#(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)), 209#true, Black: 170#(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: 169#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 167#true, 49#L1017-3true, Black: 180#(= |#race~data~0| 0), 35#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, 202#true, threadThread1of4ForFork0InUse])
[2024-03-09 06:37:34,025 INFO  L294   olderBase$Statistics]: this new event has 150 ancestors and is cut-off event
[2024-03-09 06:37:34,025 INFO  L297   olderBase$Statistics]:   existing Event has 150 ancestors and is cut-off event
[2024-03-09 06:37:34,025 INFO  L297   olderBase$Statistics]:   existing Event has 150 ancestors and is cut-off event
[2024-03-09 06:37:34,025 INFO  L297   olderBase$Statistics]:   existing Event has 150 ancestors and is cut-off event
[2024-03-09 06:37:34,026 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([685] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread3of4ForFork0_#t~nondet5_3|)  InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][145], [threadThread2of4ForFork0InUse, Black: 186#(= |ULTIMATE.start_main_~i~0#1| 0), 18#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 157#L1017true, 53#L1017-3true, Black: 171#(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)), 209#true, Black: 170#(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: 169#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 167#true, Black: 180#(= |#race~data~0| 0), 85#L1016-5true, 35#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, 202#true, threadThread1of4ForFork0InUse])
[2024-03-09 06:37:34,026 INFO  L294   olderBase$Statistics]: this new event has 150 ancestors and is cut-off event
[2024-03-09 06:37:34,026 INFO  L297   olderBase$Statistics]:   existing Event has 150 ancestors and is cut-off event
[2024-03-09 06:37:34,026 INFO  L297   olderBase$Statistics]:   existing Event has 150 ancestors and is cut-off event
[2024-03-09 06:37:34,026 INFO  L297   olderBase$Statistics]:   existing Event has 150 ancestors and is cut-off event
[2024-03-09 06:37:34,096 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][186], [threadThread2of4ForFork0InUse, Black: 186#(= |ULTIMATE.start_main_~i~0#1| 0), 42#L1016-6true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 54#L1016-5true, 209#true, Black: 171#(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: 170#(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: 169#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 167#true, Black: 180#(= |#race~data~0| 0), 49#L1017-3true, 35#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, 103#L1017true, 202#true, threadThread1of4ForFork0InUse])
[2024-03-09 06:37:34,097 INFO  L294   olderBase$Statistics]: this new event has 150 ancestors and is not cut-off event
[2024-03-09 06:37:34,097 INFO  L297   olderBase$Statistics]:   existing Event has 150 ancestors and is not cut-off event
[2024-03-09 06:37:34,097 INFO  L297   olderBase$Statistics]:   existing Event has 150 ancestors and is not cut-off event
[2024-03-09 06:37:34,097 INFO  L297   olderBase$Statistics]:   existing Event has 150 ancestors and is not cut-off event
[2024-03-09 06:37:34,138 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([717] L1016-4-->L1016-5: Formula: (= |v_threadThread2of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread2of4ForFork0_#t~nondet5=|v_threadThread2of4ForFork0_#t~nondet5_3|}  OutVars{threadThread2of4ForFork0_#t~nondet5=|v_threadThread2of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][152], [threadThread2of4ForFork0InUse, Black: 186#(= |ULTIMATE.start_main_~i~0#1| 0), 18#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 102#L1031-2true, 53#L1017-3true, Black: 171#(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: 170#(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)), 211#(= |threadThread2of4ForFork0_#t~nondet5| |#race~data~0|), Black: 169#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 51#L1016-5true, Black: 167#true, 49#L1017-3true, Black: 180#(= |#race~data~0| 0), 202#true, threadThread1of4ForFork0InUse])
[2024-03-09 06:37:34,138 INFO  L294   olderBase$Statistics]: this new event has 151 ancestors and is cut-off event
[2024-03-09 06:37:34,138 INFO  L297   olderBase$Statistics]:   existing Event has 151 ancestors and is cut-off event
[2024-03-09 06:37:34,138 INFO  L297   olderBase$Statistics]:   existing Event has 151 ancestors and is cut-off event
[2024-03-09 06:37:34,138 INFO  L297   olderBase$Statistics]:   existing Event has 151 ancestors and is cut-off event
[2024-03-09 06:37:34,141 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][173], [threadThread2of4ForFork0InUse, Black: 186#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of4ForFork0InUse, 18#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread4of4ForFork0InUse, 29#L1017-3true, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 54#L1016-5true, Black: 171#(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)), 209#true, Black: 170#(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: 169#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 167#true, Black: 180#(= |#race~data~0| 0), 49#L1017-3true, 35#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, 202#true, threadThread1of4ForFork0InUse])
[2024-03-09 06:37:34,141 INFO  L294   olderBase$Statistics]: this new event has 151 ancestors and is cut-off event
[2024-03-09 06:37:34,141 INFO  L297   olderBase$Statistics]:   existing Event has 151 ancestors and is cut-off event
[2024-03-09 06:37:34,141 INFO  L297   olderBase$Statistics]:   existing Event has 151 ancestors and is cut-off event
[2024-03-09 06:37:34,141 INFO  L297   olderBase$Statistics]:   existing Event has 151 ancestors and is cut-off event
[2024-03-09 06:37:34,142 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([685] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread3of4ForFork0_#t~nondet5_3|)  InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][145], [threadThread2of4ForFork0InUse, Black: 186#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of4ForFork0InUse, 18#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, threadThread4of4ForFork0InUse, 29#L1017-3true, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 53#L1017-3true, 209#true, Black: 171#(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: 170#(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: 169#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 167#true, Black: 180#(= |#race~data~0| 0), 85#L1016-5true, 35#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, 202#true, threadThread1of4ForFork0InUse])
[2024-03-09 06:37:34,142 INFO  L294   olderBase$Statistics]: this new event has 151 ancestors and is cut-off event
[2024-03-09 06:37:34,142 INFO  L297   olderBase$Statistics]:   existing Event has 151 ancestors and is cut-off event
[2024-03-09 06:37:34,142 INFO  L297   olderBase$Statistics]:   existing Event has 151 ancestors and is cut-off event
[2024-03-09 06:37:34,143 INFO  L297   olderBase$Statistics]:   existing Event has 151 ancestors and is cut-off event
[2024-03-09 06:37:35,277 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([634] L1031-->L1031-1: Formula: (= |v_#race~data~0_4| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][135], [threadThread2of4ForFork0InUse, Black: 186#(= |ULTIMATE.start_main_~i~0#1| 0), 42#L1016-6true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 99#L1031-1true, 16#L1015-3true, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 209#true, Black: 171#(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: 170#(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: 169#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 167#true, 90#L1016-6true, Black: 178#true, 202#true, threadThread1of4ForFork0InUse])
[2024-03-09 06:37:35,277 INFO  L294   olderBase$Statistics]: this new event has 161 ancestors and is cut-off event
[2024-03-09 06:37:35,277 INFO  L297   olderBase$Statistics]:   existing Event has 112 ancestors and is cut-off event
[2024-03-09 06:37:35,277 INFO  L297   olderBase$Statistics]:   existing Event has 112 ancestors and is cut-off event
[2024-03-09 06:37:35,277 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-03-09 06:37:35,873 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([634] L1031-->L1031-1: Formula: (= |v_#race~data~0_4| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][135], [threadThread2of4ForFork0InUse, Black: 186#(= |ULTIMATE.start_main_~i~0#1| 0), 42#L1016-6true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 99#L1031-1true, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 171#(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)), 209#true, Black: 170#(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: 169#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 167#true, 90#L1016-6true, 85#L1016-5true, Black: 178#true, 202#true, threadThread1of4ForFork0InUse])
[2024-03-09 06:37:35,873 INFO  L294   olderBase$Statistics]: this new event has 167 ancestors and is cut-off event
[2024-03-09 06:37:35,873 INFO  L297   olderBase$Statistics]:   existing Event has 167 ancestors and is cut-off event
[2024-03-09 06:37:35,873 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-03-09 06:37:35,873 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-03-09 06:37:36,143 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([634] L1031-->L1031-1: Formula: (= |v_#race~data~0_4| 0)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_4|}  AuxVars[]  AssignedVars[#race~data~0][135], [threadThread2of4ForFork0InUse, Black: 186#(= |ULTIMATE.start_main_~i~0#1| 0), 42#L1016-6true, threadThread3of4ForFork0InUse, 99#L1031-1true, threadThread4of4ForFork0NotInUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), Black: 171#(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)), 209#true, Black: 170#(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: 169#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 167#true, 90#L1016-6true, 49#L1017-3true, Black: 178#true, 202#true, threadThread1of4ForFork0InUse])
[2024-03-09 06:37:36,143 INFO  L294   olderBase$Statistics]: this new event has 171 ancestors and is cut-off event
[2024-03-09 06:37:36,143 INFO  L297   olderBase$Statistics]:   existing Event has 171 ancestors and is cut-off event
[2024-03-09 06:37:36,143 INFO  L297   olderBase$Statistics]:   existing Event has 122 ancestors and is cut-off event
[2024-03-09 06:37:36,143 INFO  L297   olderBase$Statistics]:   existing Event has 122 ancestors and is cut-off event
[2024-03-09 06:37:36,841 INFO  L124   PetriNetUnfolderBase]: 23156/76593 cut-off events.
[2024-03-09 06:37:36,841 INFO  L125   PetriNetUnfolderBase]: For 40541/77399 co-relation queries the response was YES.
[2024-03-09 06:37:37,118 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 144808 conditions, 76593 events. 23156/76593 cut-off events. For 40541/77399 co-relation queries the response was YES. Maximal size of possible extension queue 2690. Compared 1093376 event pairs, 10454 based on Foata normal form. 61/66581 useless extension candidates. Maximal degree in co-relation 88444. Up to 25530 conditions per place. 
[2024-03-09 06:37:37,384 INFO  L140   encePairwiseOnDemand]: 154/162 looper letters, 43 selfloop transitions, 18 changer transitions 0/198 dead transitions.
[2024-03-09 06:37:37,384 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 198 transitions, 753 flow
[2024-03-09 06:37:37,385 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:37:37,385 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:37:37,385 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions.
[2024-03-09 06:37:37,386 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9156378600823045
[2024-03-09 06:37:37,386 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 445 transitions.
[2024-03-09 06:37:37,386 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions.
[2024-03-09 06:37:37,386 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:37:37,386 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions.
[2024-03-09 06:37:37,387 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 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-09 06:37:37,387 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 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-09 06:37:37,387 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 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-09 06:37:37,387 INFO  L175             Difference]: Start difference. First operand has 178 places, 173 transitions, 508 flow. Second operand 3 states and 445 transitions.
[2024-03-09 06:37:37,387 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 198 transitions, 753 flow
[2024-03-09 06:37:37,478 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 198 transitions, 743 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-09 06:37:37,480 INFO  L231             Difference]: Finished difference. Result has 177 places, 187 transitions, 676 flow
[2024-03-09 06:37:37,480 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=676, PETRI_PLACES=177, PETRI_TRANSITIONS=187}
[2024-03-09 06:37:37,480 INFO  L281   CegarLoopForPetriNet]: 164 programPoint places, 13 predicate places.
[2024-03-09 06:37:37,481 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 187 transitions, 676 flow
[2024-03-09 06:37:37,481 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 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-09 06:37:37,481 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:37:37,481 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]
[2024-03-09 06:37:37,481 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-03-09 06:37:37,481 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:37:37,481 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:37:37,481 INFO  L85        PathProgramCache]: Analyzing trace with hash -495354129, now seen corresponding path program 1 times
[2024-03-09 06:37:37,482 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:37:37,482 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621832572]
[2024-03-09 06:37:37,482 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:37:37,482 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:37:37,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:37:37,537 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-09 06:37:37,537 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:37:37,537 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621832572]
[2024-03-09 06:37:37,537 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621832572] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 06:37:37,537 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46175685]
[2024-03-09 06:37:37,537 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:37:37,537 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:37:37,537 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 06:37:37,538 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-09 06:37:37,540 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-09 06:37:37,662 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:37:37,663 INFO  L262         TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-09 06:37:37,664 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 06:37:37,715 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-09 06:37:37,715 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 06:37:37,760 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-09 06:37:37,760 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [46175685] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 06:37:37,760 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 06:37:37,760 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9
[2024-03-09 06:37:37,760 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152424593]
[2024-03-09 06:37:37,760 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 06:37:37,760 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-09 06:37:37,761 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:37:37,761 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-09 06:37:37,761 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-09 06:37:37,845 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 130 out of 162
[2024-03-09 06:37:37,846 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 187 transitions, 676 flow. Second operand  has 9 states, 9 states have (on average 132.33333333333334) internal successors, (1191), 9 states have internal predecessors, (1191), 0 states have call successors, (0), 0 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-09 06:37:37,846 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:37:37,846 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 162
[2024-03-09 06:37:37,846 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:37:43,161 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][223], [threadThread2of4ForFork0NotInUse, Black: 186#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 102#L1031-2true, 54#L1016-5true, 219#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 171#(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)), 209#true, Black: 170#(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: 169#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 167#true, 90#L1016-6true, Black: 211#(= |threadThread2of4ForFork0_#t~nondet5| |#race~data~0|), 85#L1016-5true, Black: 180#(= |#race~data~0| 0), threadThread1of4ForFork0InUse])
[2024-03-09 06:37:43,161 INFO  L294   olderBase$Statistics]: this new event has 167 ancestors and is cut-off event
[2024-03-09 06:37:43,161 INFO  L297   olderBase$Statistics]:   existing Event has 167 ancestors and is cut-off event
[2024-03-09 06:37:43,161 INFO  L297   olderBase$Statistics]:   existing Event has 167 ancestors and is cut-off event
[2024-03-09 06:37:43,161 INFO  L297   olderBase$Statistics]:   existing Event has 167 ancestors and is cut-off event
[2024-03-09 06:37:43,484 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][220], [threadThread2of4ForFork0NotInUse, Black: 186#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 102#L1031-2true, 219#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 54#L1016-5true, Black: 171#(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)), 209#true, Black: 170#(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: 169#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 167#true, Black: 211#(= |threadThread2of4ForFork0_#t~nondet5| |#race~data~0|), 85#L1016-5true, Black: 180#(= |#race~data~0| 0), 103#L1017true, threadThread1of4ForFork0InUse])
[2024-03-09 06:37:43,484 INFO  L294   olderBase$Statistics]: this new event has 169 ancestors and is cut-off event
[2024-03-09 06:37:43,484 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-09 06:37:43,484 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-09 06:37:43,484 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-09 06:37:44,166 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L1016-4-->L1016-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|}  OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][223], [threadThread2of4ForFork0InUse, Black: 186#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0InUse, 29#L1017-3true, Black: 198#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 102#L1031-2true, 54#L1016-5true, 219#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 209#true, Black: 171#(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: 170#(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: 169#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 167#true, 90#L1016-6true, Black: 211#(= |threadThread2of4ForFork0_#t~nondet5| |#race~data~0|), Black: 180#(= |#race~data~0| 0), threadThread1of4ForFork0InUse])
[2024-03-09 06:37:44,167 INFO  L294   olderBase$Statistics]: this new event has 171 ancestors and is cut-off event
[2024-03-09 06:37:44,167 INFO  L297   olderBase$Statistics]:   existing Event has 171 ancestors and is cut-off event
[2024-03-09 06:37:44,167 INFO  L297   olderBase$Statistics]:   existing Event has 171 ancestors and is cut-off event
[2024-03-09 06:37:44,167 INFO  L297   olderBase$Statistics]:   existing Event has 171 ancestors and is cut-off event
[2024-03-09 06:37:45,111 INFO  L124   PetriNetUnfolderBase]: 17011/65418 cut-off events.
[2024-03-09 06:37:45,111 INFO  L125   PetriNetUnfolderBase]: For 24306/30020 co-relation queries the response was YES.
[2024-03-09 06:37:45,385 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 113789 conditions, 65418 events. 17011/65418 cut-off events. For 24306/30020 co-relation queries the response was YES. Maximal size of possible extension queue 1623. Compared 937573 event pairs, 5578 based on Foata normal form. 40/59134 useless extension candidates. Maximal degree in co-relation 83377. Up to 9168 conditions per place. 
[2024-03-09 06:37:45,589 INFO  L140   encePairwiseOnDemand]: 152/162 looper letters, 61 selfloop transitions, 10 changer transitions 0/228 dead transitions.
[2024-03-09 06:37:45,589 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 228 transitions, 912 flow
[2024-03-09 06:37:45,590 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-03-09 06:37:45,590 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-03-09 06:37:45,591 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1112 transitions.
[2024-03-09 06:37:45,591 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8580246913580247
[2024-03-09 06:37:45,591 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1112 transitions.
[2024-03-09 06:37:45,591 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1112 transitions.
[2024-03-09 06:37:45,592 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:37:45,592 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1112 transitions.
[2024-03-09 06:37:45,593 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 139.0) internal successors, (1112), 8 states have internal predecessors, (1112), 0 states have call successors, (0), 0 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-09 06:37:45,594 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 162.0) internal successors, (1458), 9 states have internal predecessors, (1458), 0 states have call successors, (0), 0 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-09 06:37:45,594 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 162.0) internal successors, (1458), 9 states have internal predecessors, (1458), 0 states have call successors, (0), 0 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-09 06:37:45,594 INFO  L175             Difference]: Start difference. First operand has 177 places, 187 transitions, 676 flow. Second operand 8 states and 1112 transitions.
[2024-03-09 06:37:45,594 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 228 transitions, 912 flow
[2024-03-09 06:37:45,727 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 228 transitions, 876 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 06:37:45,729 INFO  L231             Difference]: Finished difference. Result has 185 places, 190 transitions, 684 flow
[2024-03-09 06:37:45,729 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=684, PETRI_PLACES=185, PETRI_TRANSITIONS=190}
[2024-03-09 06:37:45,729 INFO  L281   CegarLoopForPetriNet]: 164 programPoint places, 21 predicate places.
[2024-03-09 06:37:45,729 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 190 transitions, 684 flow
[2024-03-09 06:37:45,730 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 132.33333333333334) internal successors, (1191), 9 states have internal predecessors, (1191), 0 states have call successors, (0), 0 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-09 06:37:45,730 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:37:45,730 INFO  L208   CegarLoopForPetriNet]: trace histogram [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]
[2024-03-09 06:37:45,737 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-09 06:37:45,930 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 06:37:45,935 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:37:45,935 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:37:45,935 INFO  L85        PathProgramCache]: Analyzing trace with hash 562410499, now seen corresponding path program 1 times
[2024-03-09 06:37:45,935 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:37:45,936 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031891992]
[2024-03-09 06:37:45,936 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:37:45,936 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:37:45,961 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:37:46,145 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 06:37:46,145 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:37:46,145 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031891992]
[2024-03-09 06:37:46,145 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031891992] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:37:46,145 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:37:46,146 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-09 06:37:46,146 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927090288]
[2024-03-09 06:37:46,146 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:37:46,146 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:37:46,147 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:37:46,147 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:37:46,147 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:37:46,158 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 142 out of 162
[2024-03-09 06:37:46,158 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 190 transitions, 684 flow. Second operand  has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 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-09 06:37:46,158 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:37:46,158 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 162
[2024-03-09 06:37:46,158 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:37:47,007 INFO  L124   PetriNetUnfolderBase]: 688/8236 cut-off events.
[2024-03-09 06:37:47,007 INFO  L125   PetriNetUnfolderBase]: For 2785/3255 co-relation queries the response was YES.
[2024-03-09 06:37:47,036 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13496 conditions, 8236 events. 688/8236 cut-off events. For 2785/3255 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 98023 event pairs, 149 based on Foata normal form. 199/8039 useless extension candidates. Maximal degree in co-relation 5263. Up to 662 conditions per place. 
[2024-03-09 06:37:47,049 INFO  L140   encePairwiseOnDemand]: 154/162 looper letters, 16 selfloop transitions, 8 changer transitions 0/180 dead transitions.
[2024-03-09 06:37:47,050 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 180 transitions, 643 flow
[2024-03-09 06:37:47,050 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:37:47,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:37:47,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions.
[2024-03-09 06:37:47,051 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.934156378600823
[2024-03-09 06:37:47,051 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 454 transitions.
[2024-03-09 06:37:47,051 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions.
[2024-03-09 06:37:47,052 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:37:47,052 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions.
[2024-03-09 06:37:47,052 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 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-09 06:37:47,053 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 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-09 06:37:47,053 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 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-09 06:37:47,053 INFO  L175             Difference]: Start difference. First operand has 185 places, 190 transitions, 684 flow. Second operand 3 states and 454 transitions.
[2024-03-09 06:37:47,053 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 180 transitions, 643 flow
[2024-03-09 06:37:47,062 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 180 transitions, 633 flow, removed 2 selfloop flow, removed 3 redundant places.
[2024-03-09 06:37:47,064 INFO  L231             Difference]: Finished difference. Result has 184 places, 173 transitions, 554 flow
[2024-03-09 06:37:47,064 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=184, PETRI_TRANSITIONS=173}
[2024-03-09 06:37:47,064 INFO  L281   CegarLoopForPetriNet]: 164 programPoint places, 20 predicate places.
[2024-03-09 06:37:47,064 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 173 transitions, 554 flow
[2024-03-09 06:37:47,064 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 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-09 06:37:47,064 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:37:47,065 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-03-09 06:37:47,065 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-03-09 06:37:47,065 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:37:47,065 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:37:47,065 INFO  L85        PathProgramCache]: Analyzing trace with hash -300649242, now seen corresponding path program 1 times
[2024-03-09 06:37:47,065 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:37:47,065 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489481301]
[2024-03-09 06:37:47,065 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:37:47,065 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:37:47,091 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:37:47,104 INFO  L134       CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked.
[2024-03-09 06:37:47,104 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:37:47,105 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489481301]
[2024-03-09 06:37:47,105 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489481301] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:37:47,105 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:37:47,105 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:37:47,105 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23648301]
[2024-03-09 06:37:47,105 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:37:47,105 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:37:47,105 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:37:47,105 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:37:47,106 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:37:47,124 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 134 out of 162
[2024-03-09 06:37:47,124 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 173 transitions, 554 flow. Second operand  has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 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-09 06:37:47,124 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:37:47,124 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 162
[2024-03-09 06:37:47,124 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:37:48,135 INFO  L124   PetriNetUnfolderBase]: 1114/8848 cut-off events.
[2024-03-09 06:37:48,135 INFO  L125   PetriNetUnfolderBase]: For 6778/8836 co-relation queries the response was YES.
[2024-03-09 06:37:48,154 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16774 conditions, 8848 events. 1114/8848 cut-off events. For 6778/8836 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 107966 event pairs, 714 based on Foata normal form. 24/8171 useless extension candidates. Maximal degree in co-relation 13084. Up to 2065 conditions per place. 
[2024-03-09 06:37:48,164 INFO  L140   encePairwiseOnDemand]: 157/162 looper letters, 33 selfloop transitions, 5 changer transitions 0/180 dead transitions.
[2024-03-09 06:37:48,165 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 180 transitions, 668 flow
[2024-03-09 06:37:48,165 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:37:48,165 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:37:48,165 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions.
[2024-03-09 06:37:48,166 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8950617283950617
[2024-03-09 06:37:48,166 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 435 transitions.
[2024-03-09 06:37:48,166 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions.
[2024-03-09 06:37:48,166 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:37:48,166 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions.
[2024-03-09 06:37:48,167 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 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-09 06:37:48,167 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 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-09 06:37:48,167 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 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-09 06:37:48,167 INFO  L175             Difference]: Start difference. First operand has 184 places, 173 transitions, 554 flow. Second operand 3 states and 435 transitions.
[2024-03-09 06:37:48,167 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 180 transitions, 668 flow
[2024-03-09 06:37:48,180 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 180 transitions, 660 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 06:37:48,182 INFO  L231             Difference]: Finished difference. Result has 187 places, 176 transitions, 586 flow
[2024-03-09 06:37:48,182 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=187, PETRI_TRANSITIONS=176}
[2024-03-09 06:37:48,182 INFO  L281   CegarLoopForPetriNet]: 164 programPoint places, 23 predicate places.
[2024-03-09 06:37:48,183 INFO  L495      AbstractCegarLoop]: Abstraction has has 187 places, 176 transitions, 586 flow
[2024-03-09 06:37:48,183 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 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-09 06:37:48,183 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:37:48,183 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:37:48,183 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-03-09 06:37:48,183 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:37:48,183 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:37:48,183 INFO  L85        PathProgramCache]: Analyzing trace with hash -211908834, now seen corresponding path program 1 times
[2024-03-09 06:37:48,183 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:37:48,184 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453765142]
[2024-03-09 06:37:48,184 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:37:48,184 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:37:48,198 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:37:48,214 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2024-03-09 06:37:48,214 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:37:48,214 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453765142]
[2024-03-09 06:37:48,214 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453765142] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:37:48,214 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:37:48,214 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:37:48,214 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999301660]
[2024-03-09 06:37:48,214 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:37:48,215 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:37:48,215 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:37:48,215 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:37:48,215 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:37:48,233 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 134 out of 162
[2024-03-09 06:37:48,234 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 176 transitions, 586 flow. Second operand  has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 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-09 06:37:48,234 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:37:48,234 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 162
[2024-03-09 06:37:48,234 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:37:49,227 INFO  L124   PetriNetUnfolderBase]: 1121/9276 cut-off events.
[2024-03-09 06:37:49,227 INFO  L125   PetriNetUnfolderBase]: For 9138/11543 co-relation queries the response was YES.
[2024-03-09 06:37:49,258 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18055 conditions, 9276 events. 1121/9276 cut-off events. For 9138/11543 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 114579 event pairs, 707 based on Foata normal form. 18/8649 useless extension candidates. Maximal degree in co-relation 14364. Up to 2095 conditions per place. 
[2024-03-09 06:37:49,273 INFO  L140   encePairwiseOnDemand]: 157/162 looper letters, 33 selfloop transitions, 5 changer transitions 0/182 dead transitions.
[2024-03-09 06:37:49,274 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 182 transitions, 691 flow
[2024-03-09 06:37:49,274 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:37:49,274 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:37:49,274 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions.
[2024-03-09 06:37:49,275 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8930041152263375
[2024-03-09 06:37:49,275 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 434 transitions.
[2024-03-09 06:37:49,275 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions.
[2024-03-09 06:37:49,275 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:37:49,275 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions.
[2024-03-09 06:37:49,275 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 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-09 06:37:49,276 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 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-09 06:37:49,276 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 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-09 06:37:49,276 INFO  L175             Difference]: Start difference. First operand has 187 places, 176 transitions, 586 flow. Second operand 3 states and 434 transitions.
[2024-03-09 06:37:49,276 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 182 transitions, 691 flow
[2024-03-09 06:37:49,301 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 182 transitions, 677 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-03-09 06:37:49,303 INFO  L231             Difference]: Finished difference. Result has 189 places, 179 transitions, 614 flow
[2024-03-09 06:37:49,303 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=189, PETRI_TRANSITIONS=179}
[2024-03-09 06:37:49,304 INFO  L281   CegarLoopForPetriNet]: 164 programPoint places, 25 predicate places.
[2024-03-09 06:37:49,304 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 179 transitions, 614 flow
[2024-03-09 06:37:49,304 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 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-09 06:37:49,304 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:37:49,304 INFO  L208   CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:37:49,304 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-03-09 06:37:49,304 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 06:37:49,304 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:37:49,305 INFO  L85        PathProgramCache]: Analyzing trace with hash -221598016, now seen corresponding path program 1 times
[2024-03-09 06:37:49,305 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:37:49,305 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27354830]
[2024-03-09 06:37:49,305 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:37:49,305 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:37:49,341 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:37:49,341 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 06:37:49,355 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 06:37:49,370 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 06:37:49,370 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 06:37:49,371 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2024-03-09 06:37:49,371 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2024-03-09 06:37:49,371 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2024-03-09 06:37:49,371 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2024-03-09 06:37:49,371 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2024-03-09 06:37:49,371 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2024-03-09 06:37:49,371 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2024-03-09 06:37:49,371 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2024-03-09 06:37:49,371 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2024-03-09 06:37:49,371 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2024-03-09 06:37:49,371 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2024-03-09 06:37:49,372 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-03-09 06:37:49,372 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 06:37:49,372 WARN  L233   ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 06:37:49,372 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances.
[2024-03-09 06:37:49,388 INFO  L144    ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions.
[2024-03-09 06:37:49,390 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 183 places, 180 transitions, 415 flow
[2024-03-09 06:37:49,533 INFO  L124   PetriNetUnfolderBase]: 93/1560 cut-off events.
[2024-03-09 06:37:49,533 INFO  L125   PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES.
[2024-03-09 06:37:49,538 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1666 conditions, 1560 events. 93/1560 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 7991 event pairs, 23 based on Foata normal form. 0/1344 useless extension candidates. Maximal degree in co-relation 895. Up to 80 conditions per place. 
[2024-03-09 06:37:49,538 INFO  L82        GeneralOperation]: Start removeDead. Operand has 183 places, 180 transitions, 415 flow
[2024-03-09 06:37:49,542 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 183 places, 180 transitions, 415 flow
[2024-03-09 06:37:49,542 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 06:37:49,543 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;@7eae7aed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 06:37:49,543 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 12 error locations.
[2024-03-09 06:37:49,545 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 06:37:49,545 INFO  L124   PetriNetUnfolderBase]: 3/52 cut-off events.
[2024-03-09 06:37:49,545 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 06:37:49,546 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:37:49,546 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]
[2024-03-09 06:37:49,546 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-09 06:37:49,546 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:37:49,546 INFO  L85        PathProgramCache]: Analyzing trace with hash -1262188123, now seen corresponding path program 1 times
[2024-03-09 06:37:49,546 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:37:49,546 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224968133]
[2024-03-09 06:37:49,546 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:37:49,547 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:37:49,554 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:37:49,646 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-09 06:37:49,646 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:37:49,646 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224968133]
[2024-03-09 06:37:49,646 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224968133] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:37:49,646 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:37:49,646 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:37:49,646 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21413236]
[2024-03-09 06:37:49,646 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:37:49,647 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:37:49,647 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:37:49,647 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:37:49,647 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:37:49,759 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 135 out of 180
[2024-03-09 06:37:49,760 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 180 transitions, 415 flow. Second operand  has 6 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 0 states have call successors, (0), 0 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-09 06:37:49,760 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:37:49,760 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 180
[2024-03-09 06:37:49,760 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:38:04,388 INFO  L124   PetriNetUnfolderBase]: 39523/136157 cut-off events.
[2024-03-09 06:38:04,388 INFO  L125   PetriNetUnfolderBase]: For 5419/5419 co-relation queries the response was YES.
[2024-03-09 06:38:04,908 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192885 conditions, 136157 events. 39523/136157 cut-off events. For 5419/5419 co-relation queries the response was YES. Maximal size of possible extension queue 2921. Compared 2028436 event pairs, 33951 based on Foata normal form. 1214/126984 useless extension candidates. Maximal degree in co-relation 63922. Up to 47594 conditions per place. 
[2024-03-09 06:38:05,348 INFO  L140   encePairwiseOnDemand]: 161/180 looper letters, 48 selfloop transitions, 13 changer transitions 1/196 dead transitions.
[2024-03-09 06:38:05,348 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 196 transitions, 569 flow
[2024-03-09 06:38:05,349 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:38:05,349 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:38:05,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 879 transitions.
[2024-03-09 06:38:05,350 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8138888888888889
[2024-03-09 06:38:05,350 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 879 transitions.
[2024-03-09 06:38:05,350 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 879 transitions.
[2024-03-09 06:38:05,350 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:38:05,351 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 879 transitions.
[2024-03-09 06:38:05,351 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 146.5) internal successors, (879), 6 states have internal predecessors, (879), 0 states have call successors, (0), 0 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-09 06:38:05,352 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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-09 06:38:05,352 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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-09 06:38:05,353 INFO  L175             Difference]: Start difference. First operand has 183 places, 180 transitions, 415 flow. Second operand 6 states and 879 transitions.
[2024-03-09 06:38:05,353 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 196 transitions, 569 flow
[2024-03-09 06:38:05,358 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 196 transitions, 569 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 06:38:05,359 INFO  L231             Difference]: Finished difference. Result has 189 places, 185 transitions, 497 flow
[2024-03-09 06:38:05,360 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=497, PETRI_PLACES=189, PETRI_TRANSITIONS=185}
[2024-03-09 06:38:05,360 INFO  L281   CegarLoopForPetriNet]: 183 programPoint places, 6 predicate places.
[2024-03-09 06:38:05,360 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 185 transitions, 497 flow
[2024-03-09 06:38:05,360 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 0 states have call successors, (0), 0 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-09 06:38:05,360 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:38:05,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]
[2024-03-09 06:38:05,360 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-03-09 06:38:05,361 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-09 06:38:05,361 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:38:05,361 INFO  L85        PathProgramCache]: Analyzing trace with hash 1699090265, now seen corresponding path program 1 times
[2024-03-09 06:38:05,361 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:38:05,361 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140931629]
[2024-03-09 06:38:05,361 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:38:05,361 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:38:05,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:38:05,379 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-09 06:38:05,380 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:38:05,380 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140931629]
[2024-03-09 06:38:05,380 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140931629] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:38:05,380 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:38:05,380 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:38:05,380 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311396627]
[2024-03-09 06:38:05,380 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:38:05,380 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:38:05,380 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:38:05,381 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:38:05,381 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:38:05,403 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 180
[2024-03-09 06:38:05,403 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 185 transitions, 497 flow. Second operand  has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 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-09 06:38:05,403 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:38:05,404 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 180
[2024-03-09 06:38:05,404 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:38:22,889 INFO  L124   PetriNetUnfolderBase]: 51884/148624 cut-off events.
[2024-03-09 06:38:22,889 INFO  L125   PetriNetUnfolderBase]: For 18766/30375 co-relation queries the response was YES.
[2024-03-09 06:38:23,558 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 233358 conditions, 148624 events. 51884/148624 cut-off events. For 18766/30375 co-relation queries the response was YES. Maximal size of possible extension queue 3616. Compared 2117960 event pairs, 29580 based on Foata normal form. 0/136449 useless extension candidates. Maximal degree in co-relation 217630. Up to 48608 conditions per place. 
[2024-03-09 06:38:24,267 INFO  L140   encePairwiseOnDemand]: 172/180 looper letters, 37 selfloop transitions, 7 changer transitions 4/201 dead transitions.
[2024-03-09 06:38:24,267 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 201 transitions, 617 flow
[2024-03-09 06:38:24,268 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:38:24,268 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:38:24,268 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions.
[2024-03-09 06:38:24,269 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9111111111111111
[2024-03-09 06:38:24,269 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 492 transitions.
[2024-03-09 06:38:24,269 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 492 transitions.
[2024-03-09 06:38:24,269 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:38:24,269 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 492 transitions.
[2024-03-09 06:38:24,270 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 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-09 06:38:24,270 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 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-09 06:38:24,270 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 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-09 06:38:24,270 INFO  L175             Difference]: Start difference. First operand has 189 places, 185 transitions, 497 flow. Second operand 3 states and 492 transitions.
[2024-03-09 06:38:24,270 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 201 transitions, 617 flow
[2024-03-09 06:38:26,541 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 201 transitions, 613 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 06:38:26,542 INFO  L231             Difference]: Finished difference. Result has 191 places, 187 transitions, 525 flow
[2024-03-09 06:38:26,543 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=191, PETRI_TRANSITIONS=187}
[2024-03-09 06:38:26,543 INFO  L281   CegarLoopForPetriNet]: 183 programPoint places, 8 predicate places.
[2024-03-09 06:38:26,543 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 187 transitions, 525 flow
[2024-03-09 06:38:26,543 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 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-09 06:38:26,543 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:38:26,543 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]
[2024-03-09 06:38:26,543 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-03-09 06:38:26,544 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-09 06:38:26,544 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:38:26,544 INFO  L85        PathProgramCache]: Analyzing trace with hash 479488668, now seen corresponding path program 1 times
[2024-03-09 06:38:26,544 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:38:26,544 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789532472]
[2024-03-09 06:38:26,544 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:38:26,544 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:38:26,553 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:38:26,590 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-09 06:38:26,590 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:38:26,590 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789532472]
[2024-03-09 06:38:26,590 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789532472] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:38:26,590 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:38:26,591 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:38:26,591 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454666903]
[2024-03-09 06:38:26,591 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:38:26,591 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 06:38:26,591 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:38:26,592 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 06:38:26,592 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 06:38:26,637 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 146 out of 180
[2024-03-09 06:38:26,637 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 187 transitions, 525 flow. Second operand  has 5 states, 5 states have (on average 147.4) internal successors, (737), 5 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-09 06:38:26,637 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:38:26,637 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 180
[2024-03-09 06:38:26,637 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:38:48,873 INFO  L124   PetriNetUnfolderBase]: 56092/185150 cut-off events.
[2024-03-09 06:38:48,873 INFO  L125   PetriNetUnfolderBase]: For 14021/14032 co-relation queries the response was YES.
[2024-03-09 06:38:50,010 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 286266 conditions, 185150 events. 56092/185150 cut-off events. For 14021/14032 co-relation queries the response was YES. Maximal size of possible extension queue 3666. Compared 2834830 event pairs, 39289 based on Foata normal form. 1/160030 useless extension candidates. Maximal degree in co-relation 153437. Up to 57523 conditions per place. 
[2024-03-09 06:38:50,924 INFO  L140   encePairwiseOnDemand]: 173/180 looper letters, 32 selfloop transitions, 2 changer transitions 4/190 dead transitions.
[2024-03-09 06:38:50,924 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 190 transitions, 593 flow
[2024-03-09 06:38:50,925 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 06:38:50,925 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 06:38:50,926 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 915 transitions.
[2024-03-09 06:38:50,926 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8472222222222222
[2024-03-09 06:38:50,926 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 915 transitions.
[2024-03-09 06:38:50,926 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 915 transitions.
[2024-03-09 06:38:50,926 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:38:50,926 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 915 transitions.
[2024-03-09 06:38:50,927 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 152.5) internal successors, (915), 6 states have internal predecessors, (915), 0 states have call successors, (0), 0 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-09 06:38:50,928 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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-09 06:38:50,928 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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-09 06:38:50,929 INFO  L175             Difference]: Start difference. First operand has 191 places, 187 transitions, 525 flow. Second operand 6 states and 915 transitions.
[2024-03-09 06:38:50,929 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 190 transitions, 593 flow
[2024-03-09 06:38:53,179 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 190 transitions, 565 flow, removed 7 selfloop flow, removed 2 redundant places.
[2024-03-09 06:38:53,181 INFO  L231             Difference]: Finished difference. Result has 198 places, 184 transitions, 495 flow
[2024-03-09 06:38:53,181 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=495, PETRI_PLACES=198, PETRI_TRANSITIONS=184}
[2024-03-09 06:38:53,181 INFO  L281   CegarLoopForPetriNet]: 183 programPoint places, 15 predicate places.
[2024-03-09 06:38:53,181 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 184 transitions, 495 flow
[2024-03-09 06:38:53,181 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 147.4) internal successors, (737), 5 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-09 06:38:53,182 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:38:53,182 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]
[2024-03-09 06:38:53,182 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-03-09 06:38:53,182 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-09 06:38:53,182 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:38:53,182 INFO  L85        PathProgramCache]: Analyzing trace with hash 1609321451, now seen corresponding path program 1 times
[2024-03-09 06:38:53,182 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:38:53,182 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317252461]
[2024-03-09 06:38:53,182 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:38:53,183 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:38:53,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:38:53,205 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-09 06:38:53,205 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:38:53,205 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317252461]
[2024-03-09 06:38:53,205 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317252461] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:38:53,205 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:38:53,206 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 06:38:53,206 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173968075]
[2024-03-09 06:38:53,206 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:38:53,206 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 06:38:53,206 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:38:53,207 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 06:38:53,207 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 06:38:53,235 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 147 out of 180
[2024-03-09 06:38:53,235 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 184 transitions, 495 flow. Second operand  has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 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-09 06:38:53,235 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:38:53,235 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 180
[2024-03-09 06:38:53,235 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:39:27,022 INFO  L124   PetriNetUnfolderBase]: 92663/264140 cut-off events.
[2024-03-09 06:39:27,022 INFO  L125   PetriNetUnfolderBase]: For 69520/147252 co-relation queries the response was YES.
[2024-03-09 06:39:28,655 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 456897 conditions, 264140 events. 92663/264140 cut-off events. For 69520/147252 co-relation queries the response was YES. Maximal size of possible extension queue 7229. Compared 4065392 event pairs, 55067 based on Foata normal form. 141/236464 useless extension candidates. Maximal degree in co-relation 456824. Up to 102520 conditions per place. 
[2024-03-09 06:39:29,878 INFO  L140   encePairwiseOnDemand]: 171/180 looper letters, 49 selfloop transitions, 13 changer transitions 0/211 dead transitions.
[2024-03-09 06:39:29,878 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 211 transitions, 735 flow
[2024-03-09 06:39:29,879 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 06:39:29,879 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 06:39:29,880 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions.
[2024-03-09 06:39:29,880 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9166666666666666
[2024-03-09 06:39:29,880 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 495 transitions.
[2024-03-09 06:39:29,880 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 495 transitions.
[2024-03-09 06:39:29,880 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 06:39:29,881 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 495 transitions.
[2024-03-09 06:39:29,881 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 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-09 06:39:29,882 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 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-09 06:39:29,882 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 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-09 06:39:29,882 INFO  L175             Difference]: Start difference. First operand has 198 places, 184 transitions, 495 flow. Second operand 3 states and 495 transitions.
[2024-03-09 06:39:29,882 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 211 transitions, 735 flow
[2024-03-09 06:39:31,160 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 211 transitions, 723 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-09 06:39:31,161 INFO  L231             Difference]: Finished difference. Result has 195 places, 195 transitions, 599 flow
[2024-03-09 06:39:31,162 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=599, PETRI_PLACES=195, PETRI_TRANSITIONS=195}
[2024-03-09 06:39:31,162 INFO  L281   CegarLoopForPetriNet]: 183 programPoint places, 12 predicate places.
[2024-03-09 06:39:31,162 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 195 transitions, 599 flow
[2024-03-09 06:39:31,162 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 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-09 06:39:31,163 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 06:39:31,163 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-09 06:39:31,163 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-03-09 06:39:31,163 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-09 06:39:31,163 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 06:39:31,163 INFO  L85        PathProgramCache]: Analyzing trace with hash -80611583, now seen corresponding path program 1 times
[2024-03-09 06:39:31,164 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 06:39:31,164 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958035032]
[2024-03-09 06:39:31,164 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 06:39:31,164 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 06:39:31,176 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 06:39:31,331 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-09 06:39:31,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 06:39:31,332 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958035032]
[2024-03-09 06:39:31,332 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958035032] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 06:39:31,332 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 06:39:31,332 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 06:39:31,332 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131580357]
[2024-03-09 06:39:31,332 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 06:39:31,332 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 06:39:31,333 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 06:39:31,333 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 06:39:31,333 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 06:39:31,509 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 180
[2024-03-09 06:39:31,510 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 195 transitions, 599 flow. Second operand  has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 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-09 06:39:31,510 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 06:39:31,511 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 180
[2024-03-09 06:39:31,511 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 06:39:44,085 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L1016-4-->L1016-5: Formula: (= |v_threadThread3of5ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread3of5ForFork0_#t~nondet5=|v_threadThread3of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread3of5ForFork0_#t~nondet5=|v_threadThread3of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][171], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 215#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 156#L1017true, threadThread4of5ForFork0NotInUse, 143#L1016-5true, threadThread5of5ForFork0NotInUse, 221#true, 45#L1015-3true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:44,086 INFO  L294   olderBase$Statistics]: this new event has 163 ancestors and is cut-off event
[2024-03-09 06:39:44,086 INFO  L297   olderBase$Statistics]:   existing Event has 114 ancestors and is cut-off event
[2024-03-09 06:39:44,086 INFO  L297   olderBase$Statistics]:   existing Event has 114 ancestors and is cut-off event
[2024-03-09 06:39:44,086 INFO  L297   olderBase$Statistics]:   existing Event has 163 ancestors and is cut-off event
[2024-03-09 06:39:44,469 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([913] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread5of5ForFork0_#t~nondet5_3|)  InVars {threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][232], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 172#L1017-3true, Black: 199#(= |#race~data~0| 0), 6#L1016-6true, 108#L1031-2true, 36#L1015-3true, 215#true, 81#L1016-5true, threadThread1of5ForFork0InUse, 51#L1016-5true, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, 221#true, threadThread5of5ForFork0InUse, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:44,469 INFO  L294   olderBase$Statistics]: this new event has 166 ancestors and is cut-off event
[2024-03-09 06:39:44,470 INFO  L297   olderBase$Statistics]:   existing Event has 166 ancestors and is cut-off event
[2024-03-09 06:39:44,470 INFO  L297   olderBase$Statistics]:   existing Event has 166 ancestors and is cut-off event
[2024-03-09 06:39:44,470 INFO  L297   olderBase$Statistics]:   existing Event has 166 ancestors and is cut-off event
[2024-03-09 06:39:46,625 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([929] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread4of5ForFork0_#t~nondet5_3|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][218], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 199#(= |#race~data~0| 0), 6#L1016-6true, 108#L1031-2true, 215#true, threadThread1of5ForFork0InUse, 57#L1016-5true, threadThread2of5ForFork0NotInUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 143#L1016-5true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:46,625 INFO  L294   olderBase$Statistics]: this new event has 167 ancestors and is cut-off event
[2024-03-09 06:39:46,625 INFO  L297   olderBase$Statistics]:   existing Event has 167 ancestors and is cut-off event
[2024-03-09 06:39:46,625 INFO  L297   olderBase$Statistics]:   existing Event has 167 ancestors and is cut-off event
[2024-03-09 06:39:46,625 INFO  L297   olderBase$Statistics]:   existing Event has 167 ancestors and is cut-off event
[2024-03-09 06:39:47,194 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L1016-4-->L1016-5: Formula: (= |v_threadThread3of5ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread3of5ForFork0_#t~nondet5=|v_threadThread3of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread3of5ForFork0_#t~nondet5=|v_threadThread3of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][171], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 215#true, threadThread1of5ForFork0InUse, 51#L1016-5true, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 143#L1016-5true, threadThread4of5ForFork0NotInUse, threadThread5of5ForFork0NotInUse, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:47,195 INFO  L294   olderBase$Statistics]: this new event has 167 ancestors and is cut-off event
[2024-03-09 06:39:47,195 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-03-09 06:39:47,195 INFO  L297   olderBase$Statistics]:   existing Event has 118 ancestors and is cut-off event
[2024-03-09 06:39:47,195 INFO  L297   olderBase$Statistics]:   existing Event has 167 ancestors and is cut-off event
[2024-03-09 06:39:48,410 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([929] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread4of5ForFork0_#t~nondet5_3|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][200], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 215#true, 57#L1016-5true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 156#L1017true, 143#L1016-5true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:48,410 INFO  L294   olderBase$Statistics]: this new event has 169 ancestors and is cut-off event
[2024-03-09 06:39:48,410 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-09 06:39:48,410 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-09 06:39:48,410 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-09 06:39:54,157 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L1016-4-->L1016-5: Formula: (= |v_threadThread3of5ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread3of5ForFork0_#t~nondet5=|v_threadThread3of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread3of5ForFork0_#t~nondet5=|v_threadThread3of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][171], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 215#true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), 156#L1017true, threadThread3of5ForFork0InUse, 143#L1016-5true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 221#true, 12#$Ultimate##0true, 45#L1015-3true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:54,157 INFO  L294   olderBase$Statistics]: this new event has 180 ancestors and is cut-off event
[2024-03-09 06:39:54,157 INFO  L297   olderBase$Statistics]:   existing Event has 180 ancestors and is cut-off event
[2024-03-09 06:39:54,157 INFO  L297   olderBase$Statistics]:   existing Event has 131 ancestors and is cut-off event
[2024-03-09 06:39:54,157 INFO  L297   olderBase$Statistics]:   existing Event has 131 ancestors and is cut-off event
[2024-03-09 06:39:54,158 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([929] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread4of5ForFork0_#t~nondet5_3|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][200], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 99#$Ultimate##0true, Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 215#true, threadThread1of5ForFork0InUse, 57#L1016-5true, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), 156#L1017true, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 221#true, 45#L1015-3true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:54,158 INFO  L294   olderBase$Statistics]: this new event has 180 ancestors and is cut-off event
[2024-03-09 06:39:54,158 INFO  L297   olderBase$Statistics]:   existing Event has 131 ancestors and is cut-off event
[2024-03-09 06:39:54,158 INFO  L297   olderBase$Statistics]:   existing Event has 180 ancestors and is cut-off event
[2024-03-09 06:39:54,158 INFO  L297   olderBase$Statistics]:   existing Event has 131 ancestors and is cut-off event
[2024-03-09 06:39:54,159 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([929] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread4of5ForFork0_#t~nondet5_3|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][200], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 199#(= |#race~data~0| 0), 36#L1015-3true, 108#L1031-2true, 215#true, threadThread1of5ForFork0InUse, 57#L1016-5true, 171#$Ultimate##0true, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 156#L1017true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:54,159 INFO  L294   olderBase$Statistics]: this new event has 180 ancestors and is cut-off event
[2024-03-09 06:39:54,159 INFO  L297   olderBase$Statistics]:   existing Event has 131 ancestors and is cut-off event
[2024-03-09 06:39:54,159 INFO  L297   olderBase$Statistics]:   existing Event has 131 ancestors and is cut-off event
[2024-03-09 06:39:54,160 INFO  L297   olderBase$Statistics]:   existing Event has 180 ancestors and is cut-off event
[2024-03-09 06:39:55,165 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([913] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread5of5ForFork0_#t~nondet5_3|)  InVars {threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][210], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 172#L1017-3true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 199#(= |#race~data~0| 0), 215#true, 81#L1016-5true, threadThread1of5ForFork0InUse, 51#L1016-5true, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, 39#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, 221#true, threadThread5of5ForFork0InUse, 138#L1017-3true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:55,165 INFO  L294   olderBase$Statistics]: this new event has 176 ancestors and is cut-off event
[2024-03-09 06:39:55,165 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-09 06:39:55,165 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-09 06:39:55,165 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-09 06:39:55,461 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([929] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread4of5ForFork0_#t~nondet5_3|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][200], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 36#L1015-3true, 215#true, threadThread1of5ForFork0InUse, 57#L1016-5true, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 156#L1017true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 221#true, 45#L1015-3true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:55,461 INFO  L294   olderBase$Statistics]: this new event has 182 ancestors and is cut-off event
[2024-03-09 06:39:55,462 INFO  L297   olderBase$Statistics]:   existing Event has 182 ancestors and is cut-off event
[2024-03-09 06:39:55,462 INFO  L297   olderBase$Statistics]:   existing Event has 133 ancestors and is cut-off event
[2024-03-09 06:39:55,462 INFO  L297   olderBase$Statistics]:   existing Event has 133 ancestors and is cut-off event
[2024-03-09 06:39:56,971 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([913] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread5of5ForFork0_#t~nondet5_3|)  InVars {threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][232], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 6#L1016-6true, Black: 199#(= |#race~data~0| 0), 56#L1015-3true, 108#L1031-2true, 215#true, 81#L1016-5true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 143#L1016-5true, threadThread4of5ForFork0InUse, 221#true, threadThread5of5ForFork0InUse, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:56,971 INFO  L294   olderBase$Statistics]: this new event has 186 ancestors and is cut-off event
[2024-03-09 06:39:56,971 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:56,971 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:56,972 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:56,972 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([929] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread4of5ForFork0_#t~nondet5_3|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][218], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 199#(= |#race~data~0| 0), 6#L1016-6true, 108#L1031-2true, 149#$Ultimate##0true, 215#true, 57#L1016-5true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 143#L1016-5true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:56,972 INFO  L294   olderBase$Statistics]: this new event has 184 ancestors and is cut-off event
[2024-03-09 06:39:56,972 INFO  L297   olderBase$Statistics]:   existing Event has 184 ancestors and is cut-off event
[2024-03-09 06:39:56,972 INFO  L297   olderBase$Statistics]:   existing Event has 184 ancestors and is cut-off event
[2024-03-09 06:39:56,972 INFO  L297   olderBase$Statistics]:   existing Event has 184 ancestors and is cut-off event
[2024-03-09 06:39:56,973 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([913] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread5of5ForFork0_#t~nondet5_3|)  InVars {threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][232], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 6#L1016-6true, Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 215#true, 81#L1016-5true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 143#L1016-5true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 12#$Ultimate##0true, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:56,973 INFO  L294   olderBase$Statistics]: this new event has 184 ancestors and is cut-off event
[2024-03-09 06:39:56,973 INFO  L297   olderBase$Statistics]:   existing Event has 184 ancestors and is cut-off event
[2024-03-09 06:39:56,973 INFO  L297   olderBase$Statistics]:   existing Event has 184 ancestors and is cut-off event
[2024-03-09 06:39:56,973 INFO  L297   olderBase$Statistics]:   existing Event has 184 ancestors and is cut-off event
[2024-03-09 06:39:56,974 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([913] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread5of5ForFork0_#t~nondet5_3|)  InVars {threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][232], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 99#$Ultimate##0true, Black: 199#(= |#race~data~0| 0), 6#L1016-6true, 108#L1031-2true, 215#true, 81#L1016-5true, threadThread1of5ForFork0InUse, 57#L1016-5true, threadThread2of5ForFork0NotInUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:56,974 INFO  L294   olderBase$Statistics]: this new event has 184 ancestors and is cut-off event
[2024-03-09 06:39:56,974 INFO  L297   olderBase$Statistics]:   existing Event has 184 ancestors and is cut-off event
[2024-03-09 06:39:56,974 INFO  L297   olderBase$Statistics]:   existing Event has 184 ancestors and is cut-off event
[2024-03-09 06:39:56,974 INFO  L297   olderBase$Statistics]:   existing Event has 184 ancestors and is cut-off event
[2024-03-09 06:39:56,977 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([913] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread5of5ForFork0_#t~nondet5_3|)  InVars {threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][232], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 6#L1016-6true, Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 215#true, 81#L1016-5true, threadThread1of5ForFork0InUse, 57#L1016-5true, 171#$Ultimate##0true, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0NotInUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:56,977 INFO  L294   olderBase$Statistics]: this new event has 184 ancestors and is cut-off event
[2024-03-09 06:39:56,977 INFO  L297   olderBase$Statistics]:   existing Event has 184 ancestors and is cut-off event
[2024-03-09 06:39:56,978 INFO  L297   olderBase$Statistics]:   existing Event has 184 ancestors and is cut-off event
[2024-03-09 06:39:56,978 INFO  L297   olderBase$Statistics]:   existing Event has 184 ancestors and is cut-off event
[2024-03-09 06:39:57,391 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L1016-4-->L1016-5: Formula: (= |v_threadThread3of5ForFork0_#t~nondet5_3| |v_#race~data~0_1|)  InVars {threadThread3of5ForFork0_#t~nondet5=|v_threadThread3of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread3of5ForFork0_#t~nondet5=|v_threadThread3of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][171], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 215#true, threadThread1of5ForFork0InUse, 51#L1016-5true, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 143#L1016-5true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 12#$Ultimate##0true, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:57,391 INFO  L294   olderBase$Statistics]: this new event has 184 ancestors and is cut-off event
[2024-03-09 06:39:57,391 INFO  L297   olderBase$Statistics]:   existing Event has 135 ancestors and is cut-off event
[2024-03-09 06:39:57,391 INFO  L297   olderBase$Statistics]:   existing Event has 184 ancestors and is cut-off event
[2024-03-09 06:39:57,391 INFO  L297   olderBase$Statistics]:   existing Event has 135 ancestors and is cut-off event
[2024-03-09 06:39:57,392 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([929] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread4of5ForFork0_#t~nondet5_3|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][200], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 99#$Ultimate##0true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 215#true, threadThread1of5ForFork0InUse, 57#L1016-5true, 51#L1016-5true, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:57,392 INFO  L294   olderBase$Statistics]: this new event has 184 ancestors and is cut-off event
[2024-03-09 06:39:57,392 INFO  L297   olderBase$Statistics]:   existing Event has 184 ancestors and is cut-off event
[2024-03-09 06:39:57,392 INFO  L297   olderBase$Statistics]:   existing Event has 135 ancestors and is cut-off event
[2024-03-09 06:39:57,392 INFO  L297   olderBase$Statistics]:   existing Event has 135 ancestors and is cut-off event
[2024-03-09 06:39:57,410 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([929] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread4of5ForFork0_#t~nondet5_3|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][200], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 215#true, threadThread1of5ForFork0InUse, 57#L1016-5true, 171#$Ultimate##0true, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 143#L1016-5true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:57,410 INFO  L294   olderBase$Statistics]: this new event has 184 ancestors and is cut-off event
[2024-03-09 06:39:57,410 INFO  L297   olderBase$Statistics]:   existing Event has 135 ancestors and is cut-off event
[2024-03-09 06:39:57,411 INFO  L297   olderBase$Statistics]:   existing Event has 135 ancestors and is cut-off event
[2024-03-09 06:39:57,411 INFO  L297   olderBase$Statistics]:   existing Event has 184 ancestors and is cut-off event
[2024-03-09 06:39:58,149 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([913] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread5of5ForFork0_#t~nondet5_3|)  InVars {threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][210], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 172#L1017-3true, 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 199#(= |#race~data~0| 0), 215#true, 174#L1017-3true, 81#L1016-5true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, 39#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, threadThread5of5ForFork0InUse, 138#L1017-3true, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:58,149 INFO  L294   olderBase$Statistics]: this new event has 180 ancestors and is cut-off event
[2024-03-09 06:39:58,149 INFO  L297   olderBase$Statistics]:   existing Event has 180 ancestors and is cut-off event
[2024-03-09 06:39:58,149 INFO  L297   olderBase$Statistics]:   existing Event has 180 ancestors and is cut-off event
[2024-03-09 06:39:58,149 INFO  L297   olderBase$Statistics]:   existing Event has 180 ancestors and is cut-off event
[2024-03-09 06:39:58,206 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([913] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread5of5ForFork0_#t~nondet5_3|)  InVars {threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][232], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 199#(= |#race~data~0| 0), 6#L1016-6true, 108#L1031-2true, 36#L1015-3true, 215#true, 81#L1016-5true, threadThread1of5ForFork0InUse, 57#L1016-5true, threadThread2of5ForFork0NotInUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:58,206 INFO  L294   olderBase$Statistics]: this new event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,206 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,207 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,207 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,210 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([913] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread5of5ForFork0_#t~nondet5_3|)  InVars {threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][232], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 6#L1016-6true, Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 215#true, 81#L1016-5true, threadThread1of5ForFork0InUse, 57#L1016-5true, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0NotInUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 221#true, 45#L1015-3true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:58,210 INFO  L294   olderBase$Statistics]: this new event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,210 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,211 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,211 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,390 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([929] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread4of5ForFork0_#t~nondet5_3|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][200], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 149#$Ultimate##0true, 215#true, threadThread1of5ForFork0InUse, 57#L1016-5true, threadThread2of5ForFork0NotInUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 156#L1017true, 143#L1016-5true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:58,390 INFO  L294   olderBase$Statistics]: this new event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,391 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,391 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,391 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,392 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([913] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread5of5ForFork0_#t~nondet5_3|)  InVars {threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][225], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 215#true, 81#L1016-5true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 156#L1017true, 143#L1016-5true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 12#$Ultimate##0true, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:58,392 INFO  L294   olderBase$Statistics]: this new event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,392 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,392 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,392 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,393 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([913] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread5of5ForFork0_#t~nondet5_3|)  InVars {threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][225], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 99#$Ultimate##0true, Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 215#true, 81#L1016-5true, threadThread1of5ForFork0InUse, 57#L1016-5true, threadThread2of5ForFork0NotInUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 156#L1017true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:58,393 INFO  L294   olderBase$Statistics]: this new event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,393 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,394 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,394 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,404 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([913] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread5of5ForFork0_#t~nondet5_3|)  InVars {threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][225], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 215#true, 81#L1016-5true, 57#L1016-5true, threadThread1of5ForFork0InUse, 171#$Ultimate##0true, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0NotInUse, 156#L1017true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:58,404 INFO  L294   olderBase$Statistics]: this new event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,404 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,404 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,404 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,703 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([929] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread4of5ForFork0_#t~nondet5_3|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][200], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 36#L1015-3true, 215#true, threadThread1of5ForFork0InUse, 57#L1016-5true, 51#L1016-5true, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:58,703 INFO  L294   olderBase$Statistics]: this new event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,704 INFO  L297   olderBase$Statistics]:   existing Event has 137 ancestors and is cut-off event
[2024-03-09 06:39:58,704 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,704 INFO  L297   olderBase$Statistics]:   existing Event has 137 ancestors and is cut-off event
[2024-03-09 06:39:58,711 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([929] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread4of5ForFork0_#t~nondet5_3|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][200], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 77#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 215#true, 57#L1016-5true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 143#L1016-5true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 221#true, 45#L1015-3true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:58,711 INFO  L294   olderBase$Statistics]: this new event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,711 INFO  L297   olderBase$Statistics]:   existing Event has 137 ancestors and is cut-off event
[2024-03-09 06:39:58,711 INFO  L297   olderBase$Statistics]:   existing Event has 186 ancestors and is cut-off event
[2024-03-09 06:39:58,712 INFO  L297   olderBase$Statistics]:   existing Event has 137 ancestors and is cut-off event
[2024-03-09 06:39:59,022 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([929] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread4of5ForFork0_#t~nondet5_3|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][200], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 36#L1015-3true, 215#true, threadThread1of5ForFork0InUse, 57#L1016-5true, 51#L1016-5true, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 156#L1017true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:59,023 INFO  L294   olderBase$Statistics]: this new event has 188 ancestors and is cut-off event
[2024-03-09 06:39:59,023 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is cut-off event
[2024-03-09 06:39:59,023 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is cut-off event
[2024-03-09 06:39:59,023 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is cut-off event
[2024-03-09 06:39:59,699 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([913] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread5of5ForFork0_#t~nondet5_3|)  InVars {threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][225], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 199#(= |#race~data~0| 0), 56#L1015-3true, 108#L1031-2true, 215#true, 81#L1016-5true, threadThread1of5ForFork0InUse, threadThread2of5ForFork0NotInUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 156#L1017true, 143#L1016-5true, threadThread4of5ForFork0InUse, 221#true, threadThread5of5ForFork0InUse, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:59,700 INFO  L294   olderBase$Statistics]: this new event has 188 ancestors and is cut-off event
[2024-03-09 06:39:59,700 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is cut-off event
[2024-03-09 06:39:59,700 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is cut-off event
[2024-03-09 06:39:59,700 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is cut-off event
[2024-03-09 06:39:59,700 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([913] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread5of5ForFork0_#t~nondet5_3|)  InVars {threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][225], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 36#L1015-3true, 215#true, 81#L1016-5true, threadThread1of5ForFork0InUse, 57#L1016-5true, threadThread2of5ForFork0NotInUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 156#L1017true, threadThread4of5ForFork0InUse, 221#true, threadThread5of5ForFork0InUse, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:59,700 INFO  L294   olderBase$Statistics]: this new event has 188 ancestors and is cut-off event
[2024-03-09 06:39:59,700 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is cut-off event
[2024-03-09 06:39:59,700 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is cut-off event
[2024-03-09 06:39:59,700 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is cut-off event
[2024-03-09 06:39:59,705 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([913] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread5of5ForFork0_#t~nondet5_3|)  InVars {threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  OutVars{#race~data~0=|v_#race~data~0_1|, threadThread5of5ForFork0_#t~nondet5=|v_threadThread5of5ForFork0_#t~nondet5_3|}  AuxVars[]  AssignedVars[#race~data~0][225], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 215#true, 81#L1016-5true, threadThread1of5ForFork0InUse, 57#L1016-5true, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0NotInUse, 156#L1017true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 221#true, 45#L1015-3true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:59,705 INFO  L294   olderBase$Statistics]: this new event has 188 ancestors and is cut-off event
[2024-03-09 06:39:59,705 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is cut-off event
[2024-03-09 06:39:59,705 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is cut-off event
[2024-03-09 06:39:59,706 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is cut-off event
[2024-03-09 06:39:59,730 INFO  L292   olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([929] L1016-4-->L1016-5: Formula: (= |v_#race~data~0_1| |v_threadThread4of5ForFork0_#t~nondet5_3|)  InVars {threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|}  OutVars{threadThread4of5ForFork0_#t~nondet5=|v_threadThread4of5ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_1|}  AuxVars[]  AssignedVars[#race~data~0][200], [Black: 189#(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: 190#(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: 186#true, Black: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 199#(= |#race~data~0| 0), 108#L1031-2true, 36#L1015-3true, 215#true, threadThread1of5ForFork0InUse, 57#L1016-5true, 51#L1016-5true, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 156#L1017true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:59,730 INFO  L294   olderBase$Statistics]: this new event has 188 ancestors and is cut-off event
[2024-03-09 06:39:59,730 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is cut-off event
[2024-03-09 06:39:59,730 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is cut-off event
[2024-03-09 06:39:59,731 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is cut-off event
[2024-03-09 06:39:59,731 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is cut-off event
[2024-03-09 06:39:59,777 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([846] L-1-2-->ULTIMATE.startFINAL: Formula: true  InVars {}  OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_1|, ULTIMATE.start_main_#t~mem11#1.offset=|v_ULTIMATE.start_main_#t~mem11#1.offset_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~mem13#1.base=|v_ULTIMATE.start_main_#t~mem13#1.base_1|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_1|, ULTIMATE.start_main_#t~mem13#1.offset=|v_ULTIMATE.start_main_#t~mem13#1.offset_1|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_#t~mem11#1.base=|v_ULTIMATE.start_main_#t~mem11#1.base_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_1|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_~#tids~0#1.offset, ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_#t~mem11#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~mem13#1.base, ULTIMATE.start_main_~#tids~0#1.base, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem13#1.offset, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem11#1.base, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~threads_total~0#1][117], [Black: 189#(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: 190#(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: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 197#true, 186#true, 215#true, 174#L1017-3true, threadThread1of5ForFork0InUse, 57#L1016-5true, 17#L1017-3true, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 74#ULTIMATE.startFINALtrue, 156#L1017true, 143#L1016-5true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:39:59,777 INFO  L294   olderBase$Statistics]: this new event has 183 ancestors and is cut-off event
[2024-03-09 06:39:59,777 INFO  L297   olderBase$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-09 06:39:59,777 INFO  L297   olderBase$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-09 06:39:59,777 INFO  L297   olderBase$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2024-03-09 06:40:00,293 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([846] L-1-2-->ULTIMATE.startFINAL: Formula: true  InVars {}  OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_1|, ULTIMATE.start_main_#t~mem11#1.offset=|v_ULTIMATE.start_main_#t~mem11#1.offset_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~mem13#1.base=|v_ULTIMATE.start_main_#t~mem13#1.base_1|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_1|, ULTIMATE.start_main_#t~mem13#1.offset=|v_ULTIMATE.start_main_#t~mem13#1.offset_1|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_#t~mem11#1.base=|v_ULTIMATE.start_main_#t~mem11#1.base_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_1|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_~#tids~0#1.offset, ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_#t~mem11#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~mem13#1.base, ULTIMATE.start_main_~#tids~0#1.base, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem13#1.offset, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem11#1.base, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~threads_total~0#1][117], [Black: 189#(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: 190#(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: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 172#L1017-3true, 186#true, Black: 197#true, 151#L1017-3true, 215#true, threadThread1of5ForFork0InUse, 17#L1017-3true, 51#L1016-5true, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 74#ULTIMATE.startFINALtrue, 143#L1016-5true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:40:00,293 INFO  L294   olderBase$Statistics]: this new event has 184 ancestors and is cut-off event
[2024-03-09 06:40:00,293 INFO  L297   olderBase$Statistics]:   existing Event has 184 ancestors and is cut-off event
[2024-03-09 06:40:00,293 INFO  L297   olderBase$Statistics]:   existing Event has 184 ancestors and is cut-off event
[2024-03-09 06:40:00,293 INFO  L297   olderBase$Statistics]:   existing Event has 184 ancestors and is cut-off event
[2024-03-09 06:40:00,736 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([846] L-1-2-->ULTIMATE.startFINAL: Formula: true  InVars {}  OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_1|, ULTIMATE.start_main_#t~mem11#1.offset=|v_ULTIMATE.start_main_#t~mem11#1.offset_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~mem13#1.base=|v_ULTIMATE.start_main_#t~mem13#1.base_1|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_1|, ULTIMATE.start_main_#t~mem13#1.offset=|v_ULTIMATE.start_main_#t~mem13#1.offset_1|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_#t~mem11#1.base=|v_ULTIMATE.start_main_#t~mem11#1.base_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_1|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_~#tids~0#1.offset, ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_#t~mem11#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~mem13#1.base, ULTIMATE.start_main_~#tids~0#1.base, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem13#1.offset, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem11#1.base, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~threads_total~0#1][117], [Black: 189#(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: 190#(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: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 56#L1015-3true, 186#true, Black: 197#true, 151#L1017-3true, 36#L1015-3true, 215#true, threadThread1of5ForFork0InUse, 51#L1016-5true, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), 74#ULTIMATE.startFINALtrue, threadThread3of5ForFork0InUse, threadThread4of5ForFork0InUse, threadThread5of5ForFork0NotInUse, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:40:00,736 INFO  L294   olderBase$Statistics]: this new event has 188 ancestors and is cut-off event
[2024-03-09 06:40:00,736 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is cut-off event
[2024-03-09 06:40:00,737 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is cut-off event
[2024-03-09 06:40:00,737 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is cut-off event
[2024-03-09 06:40:00,766 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([846] L-1-2-->ULTIMATE.startFINAL: Formula: true  InVars {}  OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_1|, ULTIMATE.start_main_#t~mem11#1.offset=|v_ULTIMATE.start_main_#t~mem11#1.offset_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_#t~mem13#1.base=|v_ULTIMATE.start_main_#t~mem13#1.base_1|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, ULTIMATE.start_main_#t~mem15#1.base=|v_ULTIMATE.start_main_#t~mem15#1.base_1|, ULTIMATE.start_main_#t~mem13#1.offset=|v_ULTIMATE.start_main_#t~mem13#1.offset_1|, ULTIMATE.start_main_#t~mem15#1.offset=|v_ULTIMATE.start_main_#t~mem15#1.offset_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_#t~mem11#1.base=|v_ULTIMATE.start_main_#t~mem11#1.base_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_1|}  AuxVars[]  AssignedVars[ULTIMATE.start_main_~#tids~0#1.offset, ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_#t~mem11#1.offset, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~mem13#1.base, ULTIMATE.start_main_~#tids~0#1.base, ULTIMATE.start_main_#t~mem15#1.base, ULTIMATE.start_main_#t~mem13#1.offset, ULTIMATE.start_main_#t~mem15#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~mem11#1.base, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_~threads_total~0#1][117], [Black: 189#(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: 190#(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: 188#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 172#L1017-3true, Black: 197#true, 186#true, 151#L1017-3true, 215#true, 174#L1017-3true, threadThread1of5ForFork0InUse, 17#L1017-3true, threadThread2of5ForFork0InUse, Black: 205#(= |ULTIMATE.start_main_~i~0#1| 0), threadThread3of5ForFork0InUse, 74#ULTIMATE.startFINALtrue, 143#L1016-5true, threadThread4of5ForFork0InUse, threadThread5of5ForFork0InUse, 221#true, Black: 217#(= |#race~data~0| |threadThread1of5ForFork0_#t~nondet5|)])
[2024-03-09 06:40:00,767 INFO  L294   olderBase$Statistics]: this new event has 188 ancestors and is cut-off event
[2024-03-09 06:40:00,767 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is cut-off event
[2024-03-09 06:40:00,767 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is cut-off event
[2024-03-09 06:40:00,767 INFO  L297   olderBase$Statistics]:   existing Event has 188 ancestors and is cut-off event
