/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/weaver/array-eq-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:52:52,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:52:52,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 00:52:52,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:52:52,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:52:52,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:52:52,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:52:52,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:52:52,196 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:52:52,197 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:52:52,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:52:52,197 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:52:52,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:52:52,197 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:52:52,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:52:52,198 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:52:52,198 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:52:52,198 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:52:52,198 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:52:52,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:52:52,198 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:52:52,198 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:52:52,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:52:52,199 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:52:52,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:52:52,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:52:52,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:52:52,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:52:52,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:52:52,199 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:52:52,199 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:52:52,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:52:52,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2025-03-15 00:52:52,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:52:52,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:52:52,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:52:52,643 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:52:52,644 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:52:52,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/array-eq-symm.wvr.c [2025-03-15 00:52:53,924 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd073b6ec/1a3ec6272f2640ae8694eeb1cdf52018/FLAGd268ab345 [2025-03-15 00:52:54,144 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:52:54,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/array-eq-symm.wvr.c [2025-03-15 00:52:54,153 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd073b6ec/1a3ec6272f2640ae8694eeb1cdf52018/FLAGd268ab345 [2025-03-15 00:52:54,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd073b6ec/1a3ec6272f2640ae8694eeb1cdf52018 [2025-03-15 00:52:54,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:52:54,179 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:52:54,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:52:54,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:52:54,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:52:54,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:52:54" (1/1) ... [2025-03-15 00:52:54,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@299c0f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:54, skipping insertion in model container [2025-03-15 00:52:54,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:52:54" (1/1) ... [2025-03-15 00:52:54,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:52:54,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:52:54,399 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:52:54,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:52:54,441 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:52:54,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:54 WrapperNode [2025-03-15 00:52:54,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:52:54,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:52:54,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:52:54,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:52:54,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:54" (1/1) ... [2025-03-15 00:52:54,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:54" (1/1) ... [2025-03-15 00:52:54,480 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 139 [2025-03-15 00:52:54,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:52:54,481 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:52:54,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:52:54,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:52:54,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:54" (1/1) ... [2025-03-15 00:52:54,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:54" (1/1) ... [2025-03-15 00:52:54,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:54" (1/1) ... [2025-03-15 00:52:54,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:54" (1/1) ... [2025-03-15 00:52:54,503 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:54" (1/1) ... [2025-03-15 00:52:54,504 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:54" (1/1) ... [2025-03-15 00:52:54,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:54" (1/1) ... [2025-03-15 00:52:54,508 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:54" (1/1) ... [2025-03-15 00:52:54,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:54" (1/1) ... [2025-03-15 00:52:54,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:52:54,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:52:54,511 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:52:54,511 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:52:54,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:54" (1/1) ... [2025-03-15 00:52:54,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:52:54,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:52:54,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 00:52:54,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 00:52:54,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:52:54,578 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 00:52:54,578 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 00:52:54,578 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 00:52:54,578 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 00:52:54,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:52:54,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:52:54,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 00:52:54,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:52:54,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:52:54,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:52:54,579 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 00:52:54,646 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:52:54,648 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:52:54,999 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:52:55,000 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:52:55,010 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:52:55,010 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-15 00:52:55,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:52:55 BoogieIcfgContainer [2025-03-15 00:52:55,011 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:52:55,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:52:55,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:52:55,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:52:55,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:52:54" (1/3) ... [2025-03-15 00:52:55,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0d6b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:52:55, skipping insertion in model container [2025-03-15 00:52:55,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:52:54" (2/3) ... [2025-03-15 00:52:55,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0d6b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:52:55, skipping insertion in model container [2025-03-15 00:52:55,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:52:55" (3/3) ... [2025-03-15 00:52:55,018 INFO L128 eAbstractionObserver]: Analyzing ICFG array-eq-symm.wvr.c [2025-03-15 00:52:55,029 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:52:55,030 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-symm.wvr.c that has 3 procedures, 304 locations, 1 initial locations, 4 loop locations, and 34 error locations. [2025-03-15 00:52:55,030 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:52:55,147 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 00:52:55,190 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:52:55,199 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@755705d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:52:55,199 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-03-15 00:52:55,221 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:52:55,222 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-03-15 00:52:55,224 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:52:55,224 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:55,225 INFO L221 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] [2025-03-15 00:52:55,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:52:55,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:55,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1070372582, now seen corresponding path program 1 times [2025-03-15 00:52:55,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:55,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546667805] [2025-03-15 00:52:55,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:55,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:52:55,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:55,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546667805] [2025-03-15 00:52:55,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546667805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:55,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:55,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:52:55,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546687253] [2025-03-15 00:52:55,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:55,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:55,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:55,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:55,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:55,407 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 318 [2025-03-15 00:52:55,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 318 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:55,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:55,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 318 [2025-03-15 00:52:55,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:55,628 INFO L124 PetriNetUnfolderBase]: 44/712 cut-off events. [2025-03-15 00:52:55,629 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-15 00:52:55,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 712 events. 44/712 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2997 event pairs, 15 based on Foata normal form. 22/586 useless extension candidates. Maximal degree in co-relation 527. Up to 56 conditions per place. [2025-03-15 00:52:55,643 INFO L140 encePairwiseOnDemand]: 307/318 looper letters, 16 selfloop transitions, 2 changer transitions 13/301 dead transitions. [2025-03-15 00:52:55,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 301 transitions, 650 flow [2025-03-15 00:52:55,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:55,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 897 transitions. [2025-03-15 00:52:55,661 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.940251572327044 [2025-03-15 00:52:55,665 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, -8 predicate places. [2025-03-15 00:52:55,665 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 301 transitions, 650 flow [2025-03-15 00:52:55,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:55,666 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:55,666 INFO L221 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] [2025-03-15 00:52:55,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:52:55,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:52:55,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:55,667 INFO L85 PathProgramCache]: Analyzing trace with hash 433459649, now seen corresponding path program 1 times [2025-03-15 00:52:55,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:55,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420195969] [2025-03-15 00:52:55,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:55,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:52:55,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:55,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420195969] [2025-03-15 00:52:55,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420195969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:55,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:55,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:52:55,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618399673] [2025-03-15 00:52:55,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:55,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:55,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:55,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:55,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:55,725 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 318 [2025-03-15 00:52:55,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 301 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:55,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:55,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 318 [2025-03-15 00:52:55,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:55,857 INFO L124 PetriNetUnfolderBase]: 78/961 cut-off events. [2025-03-15 00:52:55,857 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-03-15 00:52:55,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1136 conditions, 961 events. 78/961 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5406 event pairs, 33 based on Foata normal form. 0/751 useless extension candidates. Maximal degree in co-relation 841. Up to 72 conditions per place. [2025-03-15 00:52:55,865 INFO L140 encePairwiseOnDemand]: 315/318 looper letters, 16 selfloop transitions, 2 changer transitions 13/300 dead transitions. [2025-03-15 00:52:55,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 300 transitions, 684 flow [2025-03-15 00:52:55,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:55,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 889 transitions. [2025-03-15 00:52:55,867 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9318658280922432 [2025-03-15 00:52:55,867 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, -7 predicate places. [2025-03-15 00:52:55,867 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 300 transitions, 684 flow [2025-03-15 00:52:55,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:55,868 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:55,868 INFO L221 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] [2025-03-15 00:52:55,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:52:55,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:52:55,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:55,869 INFO L85 PathProgramCache]: Analyzing trace with hash 970457310, now seen corresponding path program 1 times [2025-03-15 00:52:55,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:55,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028705185] [2025-03-15 00:52:55,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:55,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:52:55,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:55,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028705185] [2025-03-15 00:52:55,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028705185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:55,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:55,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:52:55,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539682977] [2025-03-15 00:52:55,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:55,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:55,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:55,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:55,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:55,911 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 318 [2025-03-15 00:52:55,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 300 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:55,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:55,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 318 [2025-03-15 00:52:55,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:56,025 INFO L124 PetriNetUnfolderBase]: 67/887 cut-off events. [2025-03-15 00:52:56,025 INFO L125 PetriNetUnfolderBase]: For 156/172 co-relation queries the response was YES. [2025-03-15 00:52:56,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 887 events. 67/887 cut-off events. For 156/172 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4713 event pairs, 26 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 783. Up to 69 conditions per place. [2025-03-15 00:52:56,033 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 11 selfloop transitions, 1 changer transitions 13/297 dead transitions. [2025-03-15 00:52:56,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 297 transitions, 696 flow [2025-03-15 00:52:56,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 897 transitions. [2025-03-15 00:52:56,038 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.940251572327044 [2025-03-15 00:52:56,038 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, -8 predicate places. [2025-03-15 00:52:56,038 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 297 transitions, 696 flow [2025-03-15 00:52:56,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:56,039 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:56,039 INFO L221 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] [2025-03-15 00:52:56,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:52:56,039 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:52:56,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:56,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1415177104, now seen corresponding path program 1 times [2025-03-15 00:52:56,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:56,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783537334] [2025-03-15 00:52:56,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:56,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:56,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:52:56,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:56,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783537334] [2025-03-15 00:52:56,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783537334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:56,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:56,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:52:56,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909471458] [2025-03-15 00:52:56,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:56,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:56,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:56,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:56,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:56,139 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 318 [2025-03-15 00:52:56,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 297 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:56,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:56,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 318 [2025-03-15 00:52:56,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:56,305 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][206], [322#true, 4#L81-1true, thread2Thread1of1ForFork1InUse, 316#true, 85#L59-11true, thread1Thread1of1ForFork0NotInUse, 321#(= |#race~An~0| 0), 313#true]) [2025-03-15 00:52:56,305 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-15 00:52:56,307 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:56,307 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:56,308 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:56,308 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][206], [322#true, 4#L81-1true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 104#L59-10true, 321#(= |#race~An~0| 0), 313#true]) [2025-03-15 00:52:56,308 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-15 00:52:56,308 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:52:56,308 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:56,308 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:56,308 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][206], [4#L81-1true, 322#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 286#thread2Err7ASSERT_VIOLATIONDATA_RACEtrue, 321#(= |#race~An~0| 0), 313#true]) [2025-03-15 00:52:56,308 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-15 00:52:56,308 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:56,308 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:56,309 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:56,316 INFO L124 PetriNetUnfolderBase]: 107/1076 cut-off events. [2025-03-15 00:52:56,316 INFO L125 PetriNetUnfolderBase]: For 549/598 co-relation queries the response was YES. [2025-03-15 00:52:56,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 1076 events. 107/1076 cut-off events. For 549/598 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6395 event pairs, 41 based on Foata normal form. 0/850 useless extension candidates. Maximal degree in co-relation 1104. Up to 99 conditions per place. [2025-03-15 00:52:56,329 INFO L140 encePairwiseOnDemand]: 315/318 looper letters, 13 selfloop transitions, 2 changer transitions 13/296 dead transitions. [2025-03-15 00:52:56,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 296 transitions, 724 flow [2025-03-15 00:52:56,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:56,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:56,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 895 transitions. [2025-03-15 00:52:56,338 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9381551362683438 [2025-03-15 00:52:56,338 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, -7 predicate places. [2025-03-15 00:52:56,338 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 296 transitions, 724 flow [2025-03-15 00:52:56,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:56,340 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:56,340 INFO L221 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] [2025-03-15 00:52:56,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:52:56,341 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:52:56,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:56,342 INFO L85 PathProgramCache]: Analyzing trace with hash -572178155, now seen corresponding path program 1 times [2025-03-15 00:52:56,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:56,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794273859] [2025-03-15 00:52:56,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:56,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:56,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:52:56,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:56,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794273859] [2025-03-15 00:52:56,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794273859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:56,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:56,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:52:56,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781574778] [2025-03-15 00:52:56,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:56,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:52:56,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:56,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:52:56,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:52:56,870 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 318 [2025-03-15 00:52:56,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 296 transitions, 724 flow. Second operand has 6 states, 6 states have (on average 245.83333333333334) internal successors, (1475), 6 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:56,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:56,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 318 [2025-03-15 00:52:56,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:57,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][204], [4#L81-1true, 322#true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 251#L59-5true, 325#true, 321#(= |#race~An~0| 0), 313#true]) [2025-03-15 00:52:57,146 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2025-03-15 00:52:57,147 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:52:57,147 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:52:57,147 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-15 00:52:57,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][204], [4#L81-1true, 322#true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 233#L59-6true, 325#true, 321#(= |#race~An~0| 0), 313#true]) [2025-03-15 00:52:57,173 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2025-03-15 00:52:57,173 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:57,173 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:57,173 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:57,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][204], [322#true, 4#L81-1true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 325#true, 321#(= |#race~An~0| 0), 313#true, 163#L59-7true]) [2025-03-15 00:52:57,176 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2025-03-15 00:52:57,176 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-15 00:52:57,176 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-15 00:52:57,176 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-15 00:52:57,179 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][204], [322#true, 4#L81-1true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 294#L59-8true, 325#true, 321#(= |#race~An~0| 0), 313#true]) [2025-03-15 00:52:57,179 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2025-03-15 00:52:57,179 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-15 00:52:57,179 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-15 00:52:57,179 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-15 00:52:57,183 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][204], [4#L81-1true, 9#thread2Err6ASSERT_VIOLATIONDATA_RACEtrue, 322#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 325#true, 321#(= |#race~An~0| 0), 313#true]) [2025-03-15 00:52:57,183 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2025-03-15 00:52:57,183 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:57,183 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:57,183 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-15 00:52:57,183 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][204], [322#true, 4#L81-1true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 325#true, 321#(= |#race~An~0| 0), 95#L59-9true, 313#true]) [2025-03-15 00:52:57,183 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2025-03-15 00:52:57,184 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-15 00:52:57,184 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:57,184 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:57,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][204], [4#L81-1true, 322#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 104#L59-10true, 325#true, 321#(= |#race~An~0| 0), 313#true]) [2025-03-15 00:52:57,188 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-15 00:52:57,188 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:52:57,188 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:57,188 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:57,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][204], [322#true, 4#L81-1true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 286#thread2Err7ASSERT_VIOLATIONDATA_RACEtrue, 325#true, 321#(= |#race~An~0| 0), 313#true]) [2025-03-15 00:52:57,188 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-15 00:52:57,188 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:57,188 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:57,188 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:57,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][204], [4#L81-1true, 322#true, thread2Thread1of1ForFork1InUse, 85#L59-11true, 316#true, thread1Thread1of1ForFork0NotInUse, 325#true, 321#(= |#race~An~0| 0), 313#true]) [2025-03-15 00:52:57,188 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-15 00:52:57,189 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:57,189 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:57,189 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:57,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][204], [322#true, 4#L81-1true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 325#true, 321#(= |#race~An~0| 0), 313#true, 52#L59-19true]) [2025-03-15 00:52:57,202 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2025-03-15 00:52:57,202 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-15 00:52:57,202 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:57,202 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:57,203 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][204], [322#true, 4#L81-1true, thread2Thread1of1ForFork1InUse, 231#L59-18true, 316#true, thread1Thread1of1ForFork0NotInUse, 325#true, 321#(= |#race~An~0| 0), 313#true]) [2025-03-15 00:52:57,203 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2025-03-15 00:52:57,203 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-15 00:52:57,205 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-15 00:52:57,205 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-15 00:52:57,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][204], [322#true, 4#L81-1true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 290#L59-16true, 325#true, 321#(= |#race~An~0| 0), 313#true]) [2025-03-15 00:52:57,206 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2025-03-15 00:52:57,206 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:52:57,206 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:52:57,206 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:57,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][204], [112#L59-15true, 4#L81-1true, 322#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 325#true, 321#(= |#race~An~0| 0), 313#true]) [2025-03-15 00:52:57,206 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2025-03-15 00:52:57,206 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-15 00:52:57,206 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-15 00:52:57,206 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:57,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][204], [4#L81-1true, 322#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 301#thread2Err9ASSERT_VIOLATIONDATA_RACEtrue, 325#true, 321#(= |#race~An~0| 0), 313#true]) [2025-03-15 00:52:57,206 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2025-03-15 00:52:57,206 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:57,206 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:57,206 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-15 00:52:57,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][204], [322#true, 4#L81-1true, 161#L59-17true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 325#true, 321#(= |#race~An~0| 0), 313#true]) [2025-03-15 00:52:57,208 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is cut-off event [2025-03-15 00:52:57,208 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-15 00:52:57,208 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-15 00:52:57,208 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-15 00:52:57,218 INFO L124 PetriNetUnfolderBase]: 373/1916 cut-off events. [2025-03-15 00:52:57,219 INFO L125 PetriNetUnfolderBase]: For 3277/3638 co-relation queries the response was YES. [2025-03-15 00:52:57,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3242 conditions, 1916 events. 373/1916 cut-off events. For 3277/3638 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 13475 event pairs, 216 based on Foata normal form. 0/1546 useless extension candidates. Maximal degree in co-relation 2750. Up to 605 conditions per place. [2025-03-15 00:52:57,230 INFO L140 encePairwiseOnDemand]: 306/318 looper letters, 54 selfloop transitions, 10 changer transitions 13/294 dead transitions. [2025-03-15 00:52:57,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 294 transitions, 848 flow [2025-03-15 00:52:57,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:52:57,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:52:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1530 transitions. [2025-03-15 00:52:57,234 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8018867924528302 [2025-03-15 00:52:57,236 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, -4 predicate places. [2025-03-15 00:52:57,236 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 294 transitions, 848 flow [2025-03-15 00:52:57,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 245.83333333333334) internal successors, (1475), 6 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:57,237 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:57,237 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:52:57,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:52:57,237 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:52:57,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:57,238 INFO L85 PathProgramCache]: Analyzing trace with hash -91987112, now seen corresponding path program 1 times [2025-03-15 00:52:57,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:57,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529449847] [2025-03-15 00:52:57,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:57,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:52:57,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:57,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529449847] [2025-03-15 00:52:57,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529449847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:57,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:57,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:52:57,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79519852] [2025-03-15 00:52:57,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:57,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:57,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:57,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:57,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:57,282 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 318 [2025-03-15 00:52:57,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 294 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:57,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:57,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 318 [2025-03-15 00:52:57,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:57,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][201], [322#true, 4#L81-1true, thread2Thread1of1ForFork1InUse, 251#L59-5true, thread1Thread1of1ForFork0NotInUse, 316#true, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,404 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2025-03-15 00:52:57,404 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-15 00:52:57,404 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:52:57,404 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:52:57,407 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][201], [322#true, 4#L81-1true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 233#L59-6true, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,407 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2025-03-15 00:52:57,407 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:57,407 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:57,408 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:57,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][201], [322#true, 4#L81-1true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0), 163#L59-7true]) [2025-03-15 00:52:57,411 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2025-03-15 00:52:57,411 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-15 00:52:57,411 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-15 00:52:57,411 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-15 00:52:57,413 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][201], [322#true, 4#L81-1true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 294#L59-8true, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,413 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2025-03-15 00:52:57,413 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-15 00:52:57,413 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-15 00:52:57,413 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-15 00:52:57,416 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][201], [322#true, 9#thread2Err6ASSERT_VIOLATIONDATA_RACEtrue, 4#L81-1true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,416 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2025-03-15 00:52:57,416 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-15 00:52:57,417 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:57,417 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:57,417 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][201], [4#L81-1true, 322#true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 325#true, 321#(= |#race~An~0| 0), 95#L59-9true, 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,417 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2025-03-15 00:52:57,417 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-15 00:52:57,417 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:57,417 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:57,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][201], [322#true, 4#L81-1true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 286#thread2Err7ASSERT_VIOLATIONDATA_RACEtrue, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,421 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-15 00:52:57,421 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:57,421 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:57,421 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:57,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][201], [4#L81-1true, 322#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 104#L59-10true, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,421 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-15 00:52:57,421 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:52:57,421 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:57,421 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:57,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][201], [4#L81-1true, 322#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 85#L59-11true, 316#true, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,421 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-15 00:52:57,421 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:57,421 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:57,421 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:57,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][201], [322#true, 4#L81-1true, 112#L59-15true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,450 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2025-03-15 00:52:57,450 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:57,450 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-15 00:52:57,450 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-15 00:52:57,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][201], [322#true, 4#L81-1true, 231#L59-18true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,450 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2025-03-15 00:52:57,450 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-15 00:52:57,450 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-15 00:52:57,450 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-15 00:52:57,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][201], [322#true, 4#L81-1true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 290#L59-16true, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,451 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2025-03-15 00:52:57,451 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:52:57,451 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:57,451 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:52:57,451 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][201], [322#true, 4#L81-1true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 301#thread2Err9ASSERT_VIOLATIONDATA_RACEtrue, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,451 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2025-03-15 00:52:57,451 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:57,451 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-15 00:52:57,451 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:57,452 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][201], [322#true, 4#L81-1true, 161#L59-17true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,452 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is cut-off event [2025-03-15 00:52:57,452 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-15 00:52:57,452 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-15 00:52:57,452 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-15 00:52:57,455 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][201], [322#true, 4#L81-1true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 325#true, 321#(= |#race~An~0| 0), 52#L59-19true, 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,455 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2025-03-15 00:52:57,455 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:57,455 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-15 00:52:57,455 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:57,467 INFO L124 PetriNetUnfolderBase]: 360/1835 cut-off events. [2025-03-15 00:52:57,468 INFO L125 PetriNetUnfolderBase]: For 4446/4922 co-relation queries the response was YES. [2025-03-15 00:52:57,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3242 conditions, 1835 events. 360/1835 cut-off events. For 4446/4922 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 12670 event pairs, 208 based on Foata normal form. 0/1495 useless extension candidates. Maximal degree in co-relation 2733. Up to 590 conditions per place. [2025-03-15 00:52:57,477 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 11 selfloop transitions, 1 changer transitions 13/291 dead transitions. [2025-03-15 00:52:57,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 291 transitions, 860 flow [2025-03-15 00:52:57,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 897 transitions. [2025-03-15 00:52:57,479 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.940251572327044 [2025-03-15 00:52:57,481 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, -5 predicate places. [2025-03-15 00:52:57,481 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 291 transitions, 860 flow [2025-03-15 00:52:57,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:57,482 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:57,482 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:52:57,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:52:57,483 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:52:57,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:57,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1044069533, now seen corresponding path program 1 times [2025-03-15 00:52:57,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:57,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208178968] [2025-03-15 00:52:57,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:57,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:57,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:52:57,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:57,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208178968] [2025-03-15 00:52:57,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208178968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:57,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:57,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:52:57,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92412203] [2025-03-15 00:52:57,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:57,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:57,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:57,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:57,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:57,544 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 318 [2025-03-15 00:52:57,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 291 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:57,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:57,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 318 [2025-03-15 00:52:57,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:57,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][200], [322#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 53#L59true, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,665 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2025-03-15 00:52:57,665 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-15 00:52:57,665 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-15 00:52:57,665 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-03-15 00:52:57,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][200], [4#L81-1true, 322#true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 13#L59-1true, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,669 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2025-03-15 00:52:57,669 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:57,669 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-15 00:52:57,669 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:57,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][200], [322#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 325#true, 321#(= |#race~An~0| 0), 252#thread2Err4ASSERT_VIOLATIONDATA_RACEtrue, 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,670 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2025-03-15 00:52:57,670 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:57,670 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:57,670 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-15 00:52:57,683 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][200], [4#L81-1true, 322#true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 251#L59-5true, 316#true, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,683 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2025-03-15 00:52:57,683 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:52:57,683 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:52:57,683 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-15 00:52:57,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][200], [322#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 233#L59-6true, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,687 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2025-03-15 00:52:57,687 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:57,687 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:57,687 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:57,690 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][200], [4#L81-1true, 322#true, 334#true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 325#true, 321#(= |#race~An~0| 0), 313#true, 163#L59-7true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,690 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2025-03-15 00:52:57,690 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-15 00:52:57,690 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-15 00:52:57,690 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-15 00:52:57,715 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][200], [4#L81-1true, 322#true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 294#L59-8true, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,715 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2025-03-15 00:52:57,715 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-15 00:52:57,715 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-15 00:52:57,715 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-15 00:52:57,719 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][200], [4#L81-1true, 322#true, 9#thread2Err6ASSERT_VIOLATIONDATA_RACEtrue, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,719 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2025-03-15 00:52:57,719 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:57,719 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-15 00:52:57,719 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:57,720 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][200], [4#L81-1true, 322#true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 325#true, 321#(= |#race~An~0| 0), 95#L59-9true, 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,720 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2025-03-15 00:52:57,720 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:57,720 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-15 00:52:57,720 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:57,723 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][200], [322#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 286#thread2Err7ASSERT_VIOLATIONDATA_RACEtrue, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,723 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-15 00:52:57,723 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:57,723 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:57,723 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:57,723 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][200], [322#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 104#L59-10true, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,723 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-15 00:52:57,723 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:57,723 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:57,723 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:52:57,723 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][200], [4#L81-1true, 322#true, 334#true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 85#L59-11true, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,723 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-15 00:52:57,723 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:57,723 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:57,723 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:57,735 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][200], [4#L81-1true, 322#true, 112#L59-15true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,735 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2025-03-15 00:52:57,735 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:57,735 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-15 00:52:57,735 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-15 00:52:57,735 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][200], [322#true, 4#L81-1true, 334#true, 161#L59-17true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,735 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is cut-off event [2025-03-15 00:52:57,735 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-15 00:52:57,735 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-15 00:52:57,735 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-15 00:52:57,735 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][200], [322#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 290#L59-16true, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,735 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2025-03-15 00:52:57,735 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:57,735 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:52:57,735 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:52:57,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][200], [4#L81-1true, 322#true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 301#thread2Err9ASSERT_VIOLATIONDATA_RACEtrue, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,736 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2025-03-15 00:52:57,736 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:57,736 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-15 00:52:57,736 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:57,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][200], [4#L81-1true, 322#true, 334#true, thread2Thread1of1ForFork1InUse, 231#L59-18true, thread1Thread1of1ForFork0NotInUse, 316#true, 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,736 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2025-03-15 00:52:57,737 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-15 00:52:57,737 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-15 00:52:57,737 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-15 00:52:57,737 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][200], [4#L81-1true, 322#true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 325#true, 321#(= |#race~An~0| 0), 313#true, 52#L59-19true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,737 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2025-03-15 00:52:57,737 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:57,737 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-15 00:52:57,737 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:57,746 INFO L124 PetriNetUnfolderBase]: 389/1971 cut-off events. [2025-03-15 00:52:57,747 INFO L125 PetriNetUnfolderBase]: For 7377/7960 co-relation queries the response was YES. [2025-03-15 00:52:57,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3682 conditions, 1971 events. 389/1971 cut-off events. For 7377/7960 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 14037 event pairs, 225 based on Foata normal form. 0/1601 useless extension candidates. Maximal degree in co-relation 3113. Up to 617 conditions per place. [2025-03-15 00:52:57,756 INFO L140 encePairwiseOnDemand]: 315/318 looper letters, 13 selfloop transitions, 2 changer transitions 13/290 dead transitions. [2025-03-15 00:52:57,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 290 transitions, 888 flow [2025-03-15 00:52:57,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:57,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 895 transitions. [2025-03-15 00:52:57,758 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9381551362683438 [2025-03-15 00:52:57,759 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, -4 predicate places. [2025-03-15 00:52:57,759 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 290 transitions, 888 flow [2025-03-15 00:52:57,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:57,760 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:57,760 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:52:57,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:52:57,760 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:52:57,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:57,761 INFO L85 PathProgramCache]: Analyzing trace with hash -761028971, now seen corresponding path program 1 times [2025-03-15 00:52:57,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:57,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042595624] [2025-03-15 00:52:57,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:57,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:52:57,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:57,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042595624] [2025-03-15 00:52:57,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042595624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:57,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:57,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:52:57,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298908075] [2025-03-15 00:52:57,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:57,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:57,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:57,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:57,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:57,805 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 318 [2025-03-15 00:52:57,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 290 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:57,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:57,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 318 [2025-03-15 00:52:57,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:57,937 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][198], [322#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 53#L59true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,938 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2025-03-15 00:52:57,938 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-03-15 00:52:57,938 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-15 00:52:57,938 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-15 00:52:57,942 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][198], [4#L81-1true, 322#true, 334#true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 13#L59-1true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,942 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2025-03-15 00:52:57,942 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:57,942 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:57,942 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-15 00:52:57,942 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][198], [322#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 252#thread2Err4ASSERT_VIOLATIONDATA_RACEtrue, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,942 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2025-03-15 00:52:57,942 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:57,942 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:57,942 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-15 00:52:57,955 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][198], [4#L81-1true, 322#true, 334#true, thread2Thread1of1ForFork1InUse, 316#true, 251#L59-5true, thread1Thread1of1ForFork0NotInUse, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,955 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2025-03-15 00:52:57,955 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-15 00:52:57,955 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:52:57,955 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:52:57,959 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][198], [4#L81-1true, 322#true, 334#true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 233#L59-6true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,960 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2025-03-15 00:52:57,960 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:57,960 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:57,960 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:57,963 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][198], [322#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0), 163#L59-7true]) [2025-03-15 00:52:57,963 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2025-03-15 00:52:57,963 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-15 00:52:57,963 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-15 00:52:57,963 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-15 00:52:57,966 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][198], [4#L81-1true, 322#true, 334#true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 294#L59-8true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,966 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2025-03-15 00:52:57,966 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-15 00:52:57,966 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-15 00:52:57,966 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-15 00:52:57,970 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][198], [9#thread2Err6ASSERT_VIOLATIONDATA_RACEtrue, 322#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,970 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2025-03-15 00:52:57,970 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:57,970 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:57,970 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-15 00:52:57,970 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][198], [322#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 313#true, 95#L59-9true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,970 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2025-03-15 00:52:57,970 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:57,970 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:57,970 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-15 00:52:57,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][198], [322#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 85#L59-11true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,974 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-15 00:52:57,974 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:57,974 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:57,974 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:57,975 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][198], [322#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 286#thread2Err7ASSERT_VIOLATIONDATA_RACEtrue, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,975 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-15 00:52:57,975 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:57,975 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:57,975 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:57,975 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][198], [322#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 104#L59-10true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,975 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-15 00:52:57,975 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:57,975 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:57,975 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:52:57,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][198], [4#L81-1true, 322#true, 161#L59-17true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,988 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is cut-off event [2025-03-15 00:52:57,988 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-15 00:52:57,988 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-15 00:52:57,988 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-15 00:52:57,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][198], [4#L81-1true, 322#true, 334#true, 231#L59-18true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,988 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2025-03-15 00:52:57,988 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-15 00:52:57,988 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-15 00:52:57,988 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-15 00:52:57,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][198], [4#L81-1true, 322#true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 52#L59-19true, 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,988 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2025-03-15 00:52:57,988 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:57,988 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-15 00:52:57,988 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:57,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][198], [4#L81-1true, 322#true, 334#true, thread2Thread1of1ForFork1InUse, 316#true, thread1Thread1of1ForFork0NotInUse, 301#thread2Err9ASSERT_VIOLATIONDATA_RACEtrue, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,989 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2025-03-15 00:52:57,989 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:57,989 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:57,989 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-15 00:52:57,989 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][198], [112#L59-15true, 322#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,989 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2025-03-15 00:52:57,989 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:57,989 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-15 00:52:57,989 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-15 00:52:57,989 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][198], [4#L81-1true, 322#true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 316#true, 325#true, 290#L59-16true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:57,989 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2025-03-15 00:52:57,989 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:52:57,989 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:57,989 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:52:58,000 INFO L124 PetriNetUnfolderBase]: 402/1935 cut-off events. [2025-03-15 00:52:58,000 INFO L125 PetriNetUnfolderBase]: For 13776/15281 co-relation queries the response was YES. [2025-03-15 00:52:58,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4023 conditions, 1935 events. 402/1935 cut-off events. For 13776/15281 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 13673 event pairs, 206 based on Foata normal form. 17/1630 useless extension candidates. Maximal degree in co-relation 3273. Up to 630 conditions per place. [2025-03-15 00:52:58,012 INFO L140 encePairwiseOnDemand]: 310/318 looper letters, 18 selfloop transitions, 2 changer transitions 13/285 dead transitions. [2025-03-15 00:52:58,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 285 transitions, 935 flow [2025-03-15 00:52:58,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:58,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:58,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 881 transitions. [2025-03-15 00:52:58,014 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9234800838574424 [2025-03-15 00:52:58,016 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, -8 predicate places. [2025-03-15 00:52:58,016 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 285 transitions, 935 flow [2025-03-15 00:52:58,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:58,017 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:58,017 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:52:58,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:52:58,017 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:52:58,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:58,018 INFO L85 PathProgramCache]: Analyzing trace with hash -683572705, now seen corresponding path program 1 times [2025-03-15 00:52:58,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:58,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623183008] [2025-03-15 00:52:58,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:58,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:58,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:52:58,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:58,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623183008] [2025-03-15 00:52:58,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623183008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:58,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:58,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:52:58,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357804783] [2025-03-15 00:52:58,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:58,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:58,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:58,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:58,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:58,060 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 318 [2025-03-15 00:52:58,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 285 transitions, 935 flow. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:58,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:58,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 318 [2025-03-15 00:52:58,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:58,193 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 316#true, 53#L59true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,194 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2025-03-15 00:52:58,194 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-15 00:52:58,194 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-03-15 00:52:58,194 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-15 00:52:58,198 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 316#true, 259#L59-3true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,199 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2025-03-15 00:52:58,199 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-15 00:52:58,199 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-03-15 00:52:58,199 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-15 00:52:58,199 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 13#L59-1true, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,199 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2025-03-15 00:52:58,199 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:58,199 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-15 00:52:58,199 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:58,199 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 263#L59-2true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,199 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2025-03-15 00:52:58,199 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-15 00:52:58,199 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-15 00:52:58,199 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-03-15 00:52:58,199 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 252#thread2Err4ASSERT_VIOLATIONDATA_RACEtrue, 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,199 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2025-03-15 00:52:58,199 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:58,199 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:58,199 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-15 00:52:58,215 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 251#L59-5true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,215 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2025-03-15 00:52:58,215 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-15 00:52:58,215 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:52:58,215 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:52:58,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 316#true, 233#L59-6true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,220 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2025-03-15 00:52:58,220 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:58,220 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:58,220 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:58,224 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 163#L59-7true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,224 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2025-03-15 00:52:58,224 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-15 00:52:58,224 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-15 00:52:58,224 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-15 00:52:58,227 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 294#L59-8true, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,227 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2025-03-15 00:52:58,227 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-15 00:52:58,227 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-15 00:52:58,228 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-15 00:52:58,231 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [9#thread2Err6ASSERT_VIOLATIONDATA_RACEtrue, 322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,231 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2025-03-15 00:52:58,231 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-15 00:52:58,231 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:58,231 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:58,231 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 95#L59-9true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,232 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2025-03-15 00:52:58,232 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-15 00:52:58,232 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:58,232 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:58,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 271#L59-12true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,256 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2025-03-15 00:52:58,256 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-15 00:52:58,260 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-15 00:52:58,261 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-15 00:52:58,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 99#L59-13true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,261 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2025-03-15 00:52:58,261 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-15 00:52:58,261 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-15 00:52:58,261 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-15 00:52:58,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 316#true, 104#L59-10true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,261 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-15 00:52:58,261 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:58,261 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:52:58,261 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:58,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, 85#L59-11true, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,261 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-15 00:52:58,261 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:58,261 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:58,261 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:58,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 316#true, 286#thread2Err7ASSERT_VIOLATIONDATA_RACEtrue, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,262 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-15 00:52:58,262 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:58,262 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:58,262 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:58,322 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 161#L59-17true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,322 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is cut-off event [2025-03-15 00:52:58,322 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-15 00:52:58,322 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-15 00:52:58,322 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-15 00:52:58,322 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 4#L81-1true, 112#L59-15true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,322 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2025-03-15 00:52:58,322 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:58,322 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-15 00:52:58,322 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-15 00:52:58,323 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, 231#L59-18true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,323 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2025-03-15 00:52:58,323 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-15 00:52:58,323 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-15 00:52:58,323 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-15 00:52:58,323 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 52#L59-19true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,323 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2025-03-15 00:52:58,323 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:58,323 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-15 00:52:58,323 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:58,323 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 290#L59-16true, 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,323 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2025-03-15 00:52:58,323 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:52:58,323 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:52:58,323 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:58,323 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 301#thread2Err9ASSERT_VIOLATIONDATA_RACEtrue, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,323 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2025-03-15 00:52:58,326 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:58,327 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-15 00:52:58,327 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:58,343 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 316#true, 77#L60-1true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,343 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2025-03-15 00:52:58,343 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-15 00:52:58,343 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-15 00:52:58,343 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-15 00:52:58,345 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 230#L60-2true, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,345 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2025-03-15 00:52:58,345 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-03-15 00:52:58,345 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-03-15 00:52:58,345 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:58,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][196], [322#true, 316#true, 32#L60-6true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 340#true, 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:58,354 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-03-15 00:52:58,354 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-15 00:52:58,354 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-15 00:52:58,354 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-15 00:52:58,356 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][196], [322#true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 19#L60-7true, 340#true, 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:58,356 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-03-15 00:52:58,356 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-15 00:52:58,357 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-03-15 00:52:58,357 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-15 00:52:58,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][196], [322#true, 316#true, 6#thread2Err11ASSERT_VIOLATIONDATA_RACEtrue, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 340#true, 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:58,357 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-03-15 00:52:58,357 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-15 00:52:58,357 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-15 00:52:58,357 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-03-15 00:52:58,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 239#L58-1true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,360 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-03-15 00:52:58,360 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-03-15 00:52:58,361 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-03-15 00:52:58,361 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-15 00:52:58,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][197], [322#true, 193#L58-2true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,361 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2025-03-15 00:52:58,361 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-15 00:52:58,361 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-15 00:52:58,362 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-15 00:52:58,362 INFO L124 PetriNetUnfolderBase]: 456/1964 cut-off events. [2025-03-15 00:52:58,362 INFO L125 PetriNetUnfolderBase]: For 26781/28938 co-relation queries the response was YES. [2025-03-15 00:52:58,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4880 conditions, 1964 events. 456/1964 cut-off events. For 26781/28938 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 13550 event pairs, 215 based on Foata normal form. 0/1690 useless extension candidates. Maximal degree in co-relation 3987. Up to 694 conditions per place. [2025-03-15 00:52:58,381 INFO L140 encePairwiseOnDemand]: 310/318 looper letters, 16 selfloop transitions, 2 changer transitions 17/280 dead transitions. [2025-03-15 00:52:58,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 280 transitions, 986 flow [2025-03-15 00:52:58,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:58,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 881 transitions. [2025-03-15 00:52:58,388 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9234800838574424 [2025-03-15 00:52:58,389 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, -12 predicate places. [2025-03-15 00:52:58,389 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 280 transitions, 986 flow [2025-03-15 00:52:58,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:58,389 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:58,390 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:52:58,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:52:58,390 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:52:58,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:58,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1179023649, now seen corresponding path program 1 times [2025-03-15 00:52:58,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:58,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063755915] [2025-03-15 00:52:58,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:58,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:52:58,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:58,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063755915] [2025-03-15 00:52:58,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063755915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:58,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:58,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:52:58,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415996905] [2025-03-15 00:52:58,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:58,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:58,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:58,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:58,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:58,456 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 318 [2025-03-15 00:52:58,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 280 transitions, 986 flow. Second operand has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:58,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:58,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 318 [2025-03-15 00:52:58,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:58,641 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 53#L59true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,642 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2025-03-15 00:52:58,642 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-15 00:52:58,642 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-15 00:52:58,642 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-03-15 00:52:58,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 259#L59-3true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,650 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2025-03-15 00:52:58,650 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-03-15 00:52:58,650 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-15 00:52:58,650 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-15 00:52:58,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 263#L59-2true, 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,651 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2025-03-15 00:52:58,651 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-15 00:52:58,651 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-15 00:52:58,651 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2025-03-15 00:52:58,651 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 13#L59-1true, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,651 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2025-03-15 00:52:58,651 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:58,651 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:58,651 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-15 00:52:58,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 252#thread2Err4ASSERT_VIOLATIONDATA_RACEtrue, 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,652 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2025-03-15 00:52:58,652 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:58,652 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:58,652 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-03-15 00:52:58,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 251#L59-5true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,678 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-03-15 00:52:58,678 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:52:58,678 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-15 00:52:58,678 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:52:58,683 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 233#L59-6true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,684 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-03-15 00:52:58,684 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:58,684 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-03-15 00:52:58,684 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:58,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 163#L59-7true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,689 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2025-03-15 00:52:58,689 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-15 00:52:58,689 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-15 00:52:58,689 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-15 00:52:58,693 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 294#L59-8true, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,693 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2025-03-15 00:52:58,694 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-03-15 00:52:58,694 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-15 00:52:58,694 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-15 00:52:58,699 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 9#thread2Err6ASSERT_VIOLATIONDATA_RACEtrue, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,699 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2025-03-15 00:52:58,699 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:58,699 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:58,699 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-15 00:52:58,699 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 343#true, 95#L59-9true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,699 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2025-03-15 00:52:58,699 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:58,699 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-03-15 00:52:58,699 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-15 00:52:58,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 343#true, 271#L59-12true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,704 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is cut-off event [2025-03-15 00:52:58,704 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-15 00:52:58,704 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-15 00:52:58,704 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-15 00:52:58,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 99#L59-13true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,704 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2025-03-15 00:52:58,704 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-15 00:52:58,704 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-15 00:52:58,704 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-15 00:52:58,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 286#thread2Err7ASSERT_VIOLATIONDATA_RACEtrue, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,706 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2025-03-15 00:52:58,706 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:58,706 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:58,706 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:58,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 104#L59-10true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,706 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2025-03-15 00:52:58,706 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:58,706 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:58,706 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:52:58,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, 85#L59-11true, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,706 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2025-03-15 00:52:58,706 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:58,706 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:58,706 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:58,726 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 343#true, 112#L59-15true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,726 INFO L294 olderBase$Statistics]: this new event has 177 ancestors and is cut-off event [2025-03-15 00:52:58,726 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-15 00:52:58,726 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:58,726 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-15 00:52:58,729 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 290#L59-16true, 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,730 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2025-03-15 00:52:58,730 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:58,730 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:52:58,730 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:52:58,733 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, 231#L59-18true, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,733 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2025-03-15 00:52:58,733 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-15 00:52:58,734 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-15 00:52:58,734 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-15 00:52:58,734 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 301#thread2Err9ASSERT_VIOLATIONDATA_RACEtrue, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,734 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2025-03-15 00:52:58,734 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:58,734 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:58,734 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-15 00:52:58,734 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 161#L59-17true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,734 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-03-15 00:52:58,734 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-15 00:52:58,734 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-15 00:52:58,734 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-15 00:52:58,734 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 52#L59-19true, 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,734 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2025-03-15 00:52:58,734 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:58,734 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:58,734 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-15 00:52:58,737 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 77#L60-1true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,737 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-03-15 00:52:58,737 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-15 00:52:58,737 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-15 00:52:58,737 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-15 00:52:58,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 230#L60-2true, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,739 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-03-15 00:52:58,739 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-03-15 00:52:58,739 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:58,739 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-03-15 00:52:58,744 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][193], [322#true, 32#L60-6true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 340#true, 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:58,744 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2025-03-15 00:52:58,744 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-15 00:52:58,744 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-15 00:52:58,744 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-15 00:52:58,746 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][193], [322#true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 19#L60-7true, 340#true, 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:58,746 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2025-03-15 00:52:58,746 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-03-15 00:52:58,746 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-15 00:52:58,746 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-15 00:52:58,746 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][193], [322#true, 316#true, 6#thread2Err11ASSERT_VIOLATIONDATA_RACEtrue, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 340#true, 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:58,746 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2025-03-15 00:52:58,747 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-03-15 00:52:58,747 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-15 00:52:58,747 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-15 00:52:58,749 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 239#L58-1true, 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,749 INFO L294 olderBase$Statistics]: this new event has 194 ancestors and is cut-off event [2025-03-15 00:52:58,749 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-03-15 00:52:58,749 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-15 00:52:58,750 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-03-15 00:52:58,750 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][194], [322#true, 193#L58-2true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:58,750 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-03-15 00:52:58,750 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-15 00:52:58,750 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-15 00:52:58,750 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-15 00:52:58,750 INFO L124 PetriNetUnfolderBase]: 438/1952 cut-off events. [2025-03-15 00:52:58,750 INFO L125 PetriNetUnfolderBase]: For 48889/53500 co-relation queries the response was YES. [2025-03-15 00:52:58,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5120 conditions, 1952 events. 438/1952 cut-off events. For 48889/53500 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 13451 event pairs, 189 based on Foata normal form. 84/1770 useless extension candidates. Maximal degree in co-relation 4177. Up to 674 conditions per place. [2025-03-15 00:52:58,776 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 12 selfloop transitions, 3 changer transitions 17/282 dead transitions. [2025-03-15 00:52:58,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 282 transitions, 1043 flow [2025-03-15 00:52:58,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 909 transitions. [2025-03-15 00:52:58,779 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9528301886792453 [2025-03-15 00:52:58,779 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, -10 predicate places. [2025-03-15 00:52:58,779 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 282 transitions, 1043 flow [2025-03-15 00:52:58,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:58,780 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:58,780 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:52:58,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:52:58,781 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:52:58,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:58,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1784315164, now seen corresponding path program 1 times [2025-03-15 00:52:58,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:58,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568608304] [2025-03-15 00:52:58,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:58,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:58,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:52:58,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:58,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568608304] [2025-03-15 00:52:58,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568608304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:58,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:58,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:52:58,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366624342] [2025-03-15 00:52:58,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:58,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:58,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:58,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:58,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:58,828 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 318 [2025-03-15 00:52:58,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 282 transitions, 1043 flow. Second operand has 3 states, 3 states have (on average 298.6666666666667) internal successors, (896), 3 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:58,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:58,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 318 [2025-03-15 00:52:58,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:59,051 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][219], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 348#(= |#race~A~0| 0), 321#(= |#race~An~0| 0), 239#L58-1true, 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:59,051 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2025-03-15 00:52:59,051 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-15 00:52:59,051 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-03-15 00:52:59,051 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-15 00:52:59,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][219], [322#true, 193#L58-2true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 348#(= |#race~A~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:59,059 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2025-03-15 00:52:59,059 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:52:59,059 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-15 00:52:59,059 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-15 00:52:59,090 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][219], [322#true, 316#true, 104#L59-10true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 348#(= |#race~A~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:59,091 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2025-03-15 00:52:59,091 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-15 00:52:59,091 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:59,091 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:59,091 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][219], [322#true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 348#(= |#race~A~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, 85#L59-11true, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:59,091 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2025-03-15 00:52:59,091 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 00:52:59,091 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:59,091 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:59,091 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][219], [322#true, 99#L59-13true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 348#(= |#race~A~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:59,091 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2025-03-15 00:52:59,091 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-15 00:52:59,091 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-15 00:52:59,091 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-03-15 00:52:59,091 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][219], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 348#(= |#race~A~0| 0), 343#true, 271#L59-12true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:59,091 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is cut-off event [2025-03-15 00:52:59,091 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-15 00:52:59,091 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-15 00:52:59,091 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-15 00:52:59,126 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][219], [322#true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 348#(= |#race~A~0| 0), 343#true, 112#L59-15true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:59,126 INFO L294 olderBase$Statistics]: this new event has 177 ancestors and is cut-off event [2025-03-15 00:52:59,126 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 00:52:59,126 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-15 00:52:59,126 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-15 00:52:59,129 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][219], [322#true, 316#true, 290#L59-16true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 348#(= |#race~A~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:59,129 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2025-03-15 00:52:59,129 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:52:59,129 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:52:59,129 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 00:52:59,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][219], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 348#(= |#race~A~0| 0), 343#true, 52#L59-19true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:59,132 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2025-03-15 00:52:59,132 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-15 00:52:59,132 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:59,132 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:59,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][219], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 348#(= |#race~A~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 301#thread2Err9ASSERT_VIOLATIONDATA_RACEtrue, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:59,133 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2025-03-15 00:52:59,133 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-03-15 00:52:59,133 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:59,133 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:59,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][219], [322#true, 161#L59-17true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 348#(= |#race~A~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:59,133 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-03-15 00:52:59,133 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-15 00:52:59,133 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-03-15 00:52:59,133 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-03-15 00:52:59,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][219], [322#true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 348#(= |#race~A~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, 231#L59-18true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:59,133 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2025-03-15 00:52:59,133 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-15 00:52:59,133 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-03-15 00:52:59,133 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-15 00:52:59,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][219], [322#true, 316#true, 77#L60-1true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 348#(= |#race~A~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:59,136 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-03-15 00:52:59,136 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-15 00:52:59,136 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-15 00:52:59,136 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-15 00:52:59,139 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][219], [322#true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 321#(= |#race~An~0| 0), 348#(= |#race~A~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 230#L60-2true, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:59,139 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-03-15 00:52:59,139 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2025-03-15 00:52:59,139 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-03-15 00:52:59,139 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-03-15 00:52:59,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][282], [322#true, 316#true, 32#L60-6true, 339#(= |#race~i_AB~0| 0), 325#true, 348#(= |#race~A~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 340#true, 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:59,146 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2025-03-15 00:52:59,146 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-15 00:52:59,146 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-15 00:52:59,146 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-15 00:52:59,147 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][282], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 348#(= |#race~A~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 19#L60-7true, 340#true, 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:59,147 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2025-03-15 00:52:59,147 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-03-15 00:52:59,147 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-15 00:52:59,147 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-15 00:52:59,147 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][282], [322#true, 316#true, 6#thread2Err11ASSERT_VIOLATIONDATA_RACEtrue, 339#(= |#race~i_AB~0| 0), 325#true, 348#(= |#race~A~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 340#true, 313#true, 333#(= |#race~Bn~0| 0)]) [2025-03-15 00:52:59,147 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2025-03-15 00:52:59,148 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-03-15 00:52:59,148 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-15 00:52:59,148 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-15 00:52:59,149 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][219], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 239#L58-1true, 348#(= |#race~A~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:59,149 INFO L294 olderBase$Statistics]: this new event has 194 ancestors and is cut-off event [2025-03-15 00:52:59,149 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-15 00:52:59,149 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-03-15 00:52:59,149 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-03-15 00:52:59,149 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-03-15 00:52:59,150 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][219], [322#true, 193#L58-2true, 316#true, 339#(= |#race~i_AB~0| 0), 325#true, 348#(= |#race~A~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:52:59,150 INFO L294 olderBase$Statistics]: this new event has 195 ancestors and is cut-off event [2025-03-15 00:52:59,150 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-03-15 00:52:59,150 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-15 00:52:59,150 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-15 00:52:59,150 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-15 00:52:59,150 INFO L124 PetriNetUnfolderBase]: 509/2247 cut-off events. [2025-03-15 00:52:59,150 INFO L125 PetriNetUnfolderBase]: For 66415/71073 co-relation queries the response was YES. [2025-03-15 00:52:59,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6514 conditions, 2247 events. 509/2247 cut-off events. For 66415/71073 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 16426 event pairs, 204 based on Foata normal form. 18/1982 useless extension candidates. Maximal degree in co-relation 5254. Up to 744 conditions per place. [2025-03-15 00:52:59,168 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 17 selfloop transitions, 2 changer transitions 18/288 dead transitions. [2025-03-15 00:52:59,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 288 transitions, 1235 flow [2025-03-15 00:52:59,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2025-03-15 00:52:59,170 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9517819706498952 [2025-03-15 00:52:59,170 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, -10 predicate places. [2025-03-15 00:52:59,170 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 288 transitions, 1235 flow [2025-03-15 00:52:59,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.6666666666667) internal successors, (896), 3 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:59,171 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:59,171 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:52:59,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:52:59,171 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:52:59,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:59,172 INFO L85 PathProgramCache]: Analyzing trace with hash 2005517355, now seen corresponding path program 1 times [2025-03-15 00:52:59,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:59,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682202472] [2025-03-15 00:52:59,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:59,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:52:59,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:59,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682202472] [2025-03-15 00:52:59,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682202472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:59,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:59,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:52:59,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287382180] [2025-03-15 00:52:59,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:59,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:59,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:59,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:59,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:59,216 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 318 [2025-03-15 00:52:59,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 288 transitions, 1235 flow. Second operand has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:59,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:59,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 318 [2025-03-15 00:52:59,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:59,434 INFO L124 PetriNetUnfolderBase]: 397/2026 cut-off events. [2025-03-15 00:52:59,434 INFO L125 PetriNetUnfolderBase]: For 38169/40429 co-relation queries the response was YES. [2025-03-15 00:52:59,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5651 conditions, 2026 events. 397/2026 cut-off events. For 38169/40429 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 14654 event pairs, 245 based on Foata normal form. 9/1763 useless extension candidates. Maximal degree in co-relation 4150. Up to 654 conditions per place. [2025-03-15 00:52:59,449 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 17 selfloop transitions, 3 changer transitions 20/291 dead transitions. [2025-03-15 00:52:59,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 291 transitions, 1339 flow [2025-03-15 00:52:59,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:59,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:59,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 909 transitions. [2025-03-15 00:52:59,451 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9528301886792453 [2025-03-15 00:52:59,452 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, -8 predicate places. [2025-03-15 00:52:59,452 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 291 transitions, 1339 flow [2025-03-15 00:52:59,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:59,453 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:59,453 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:52:59,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:52:59,453 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:52:59,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:59,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1689376811, now seen corresponding path program 1 times [2025-03-15 00:52:59,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:59,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323520726] [2025-03-15 00:52:59,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:59,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:59,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:52:59,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:59,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323520726] [2025-03-15 00:52:59,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323520726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:59,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:59,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:52:59,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221185823] [2025-03-15 00:52:59,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:59,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:52:59,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:59,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:52:59,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:52:59,503 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 318 [2025-03-15 00:52:59,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 291 transitions, 1339 flow. Second operand has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:59,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:59,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 318 [2025-03-15 00:52:59,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:52:59,748 INFO L124 PetriNetUnfolderBase]: 424/2123 cut-off events. [2025-03-15 00:52:59,749 INFO L125 PetriNetUnfolderBase]: For 44539/46708 co-relation queries the response was YES. [2025-03-15 00:52:59,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6213 conditions, 2123 events. 424/2123 cut-off events. For 44539/46708 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 15373 event pairs, 190 based on Foata normal form. 9/1867 useless extension candidates. Maximal degree in co-relation 4660. Up to 679 conditions per place. [2025-03-15 00:52:59,761 INFO L140 encePairwiseOnDemand]: 314/318 looper letters, 19 selfloop transitions, 2 changer transitions 20/293 dead transitions. [2025-03-15 00:52:59,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 293 transitions, 1447 flow [2025-03-15 00:52:59,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:52:59,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:52:59,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2025-03-15 00:52:59,763 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9517819706498952 [2025-03-15 00:52:59,764 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, -8 predicate places. [2025-03-15 00:52:59,764 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 293 transitions, 1447 flow [2025-03-15 00:52:59,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:59,764 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:52:59,764 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:52:59,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 00:52:59,765 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:52:59,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:52:59,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1289808190, now seen corresponding path program 1 times [2025-03-15 00:52:59,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:52:59,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058591445] [2025-03-15 00:52:59,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:52:59,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:52:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:52:59,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:52:59,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:52:59,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058591445] [2025-03-15 00:52:59,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058591445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:52:59,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:52:59,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:52:59,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437380913] [2025-03-15 00:52:59,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:52:59,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:52:59,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:52:59,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:52:59,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:52:59,965 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 318 [2025-03-15 00:52:59,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 293 transitions, 1447 flow. Second operand has 8 states, 8 states have (on average 239.625) internal successors, (1917), 8 states have internal predecessors, (1917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:52:59,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:52:59,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 318 [2025-03-15 00:52:59,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:53:00,796 INFO L124 PetriNetUnfolderBase]: 895/4281 cut-off events. [2025-03-15 00:53:00,797 INFO L125 PetriNetUnfolderBase]: For 77245/81815 co-relation queries the response was YES. [2025-03-15 00:53:00,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13769 conditions, 4281 events. 895/4281 cut-off events. For 77245/81815 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 34140 event pairs, 456 based on Foata normal form. 87/3847 useless extension candidates. Maximal degree in co-relation 8979. Up to 1394 conditions per place. [2025-03-15 00:53:00,831 INFO L140 encePairwiseOnDemand]: 301/318 looper letters, 142 selfloop transitions, 19 changer transitions 28/380 dead transitions. [2025-03-15 00:53:00,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 380 transitions, 2630 flow [2025-03-15 00:53:00,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 00:53:00,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 00:53:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2971 transitions. [2025-03-15 00:53:00,838 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7785639412997903 [2025-03-15 00:53:00,839 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, 3 predicate places. [2025-03-15 00:53:00,839 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 380 transitions, 2630 flow [2025-03-15 00:53:00,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 239.625) internal successors, (1917), 8 states have internal predecessors, (1917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:53:00,840 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:53:00,841 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:53:00,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 00:53:00,841 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:53:00,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:53:00,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1452378619, now seen corresponding path program 1 times [2025-03-15 00:53:00,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:53:00,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122807982] [2025-03-15 00:53:00,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:53:00,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:53:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:53:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:53:01,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:53:01,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122807982] [2025-03-15 00:53:01,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122807982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:53:01,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:53:01,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:53:01,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266544972] [2025-03-15 00:53:01,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:53:01,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:53:01,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:53:01,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:53:01,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:53:01,065 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 318 [2025-03-15 00:53:01,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 380 transitions, 2630 flow. Second operand has 8 states, 8 states have (on average 239.75) internal successors, (1918), 8 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:53:01,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:53:01,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 318 [2025-03-15 00:53:01,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:53:02,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][419], [139#L58-3true, 322#true, 316#true, 349#true, 339#(= |#race~i_AB~0| 0), 325#true, 348#(= |#race~A~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 354#(= |#race~B~0| 0), 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0), 375#true, 355#true]) [2025-03-15 00:53:02,328 INFO L294 olderBase$Statistics]: this new event has 306 ancestors and is cut-off event [2025-03-15 00:53:02,328 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is cut-off event [2025-03-15 00:53:02,328 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-03-15 00:53:02,328 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-15 00:53:02,329 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][419], [322#true, 220#L58-4true, 316#true, 349#true, 325#true, 339#(= |#race~i_AB~0| 0), 348#(= |#race~A~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 354#(= |#race~B~0| 0), 313#true, 333#(= |#race~Bn~0| 0), 355#true, 342#(= |#race~i_BA~0| 0), 375#true]) [2025-03-15 00:53:02,329 INFO L294 olderBase$Statistics]: this new event has 307 ancestors and is cut-off event [2025-03-15 00:53:02,329 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2025-03-15 00:53:02,329 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-15 00:53:02,329 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-15 00:53:02,331 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][419], [322#true, 110#L58-5true, 316#true, 349#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 348#(= |#race~A~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 354#(= |#race~B~0| 0), 313#true, 333#(= |#race~Bn~0| 0), 355#true, 342#(= |#race~i_BA~0| 0), 375#true]) [2025-03-15 00:53:02,331 INFO L294 olderBase$Statistics]: this new event has 308 ancestors and is cut-off event [2025-03-15 00:53:02,331 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2025-03-15 00:53:02,331 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-03-15 00:53:02,331 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-15 00:53:02,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][419], [322#true, 316#true, 349#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 348#(= |#race~A~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 31#L58-6true, 354#(= |#race~B~0| 0), 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0), 355#true, 375#true]) [2025-03-15 00:53:02,332 INFO L294 olderBase$Statistics]: this new event has 309 ancestors and is cut-off event [2025-03-15 00:53:02,332 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2025-03-15 00:53:02,332 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-15 00:53:02,332 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-03-15 00:53:02,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][421], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 348#(= |#race~A~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 351#(not |thread2Thread1of1ForFork1_#t~short6|), 354#(= |#race~B~0| 0), 206#L58-12true, 313#true, 333#(= |#race~Bn~0| 0), 375#true, 355#true, 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:53:02,333 INFO L294 olderBase$Statistics]: this new event has 309 ancestors and is cut-off event [2025-03-15 00:53:02,333 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2025-03-15 00:53:02,333 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-15 00:53:02,333 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-03-15 00:53:02,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][419], [322#true, 316#true, 349#true, 325#true, 339#(= |#race~i_AB~0| 0), 321#(= |#race~An~0| 0), 173#L58-7true, 348#(= |#race~A~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 354#(= |#race~B~0| 0), 313#true, 333#(= |#race~Bn~0| 0), 355#true, 342#(= |#race~i_BA~0| 0), 375#true]) [2025-03-15 00:53:02,334 INFO L294 olderBase$Statistics]: this new event has 310 ancestors and is cut-off event [2025-03-15 00:53:02,334 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-15 00:53:02,334 INFO L297 olderBase$Statistics]: existing Event has 265 ancestors and is cut-off event [2025-03-15 00:53:02,334 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2025-03-15 00:53:02,335 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][421], [322#true, 316#true, 325#true, 339#(= |#race~i_AB~0| 0), 348#(= |#race~A~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 354#(= |#race~B~0| 0), 351#(not |thread2Thread1of1ForFork1_#t~short6|), 313#true, 222#L58-15true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0), 375#true, 355#true]) [2025-03-15 00:53:02,335 INFO L294 olderBase$Statistics]: this new event has 310 ancestors and is cut-off event [2025-03-15 00:53:02,335 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2025-03-15 00:53:02,335 INFO L297 olderBase$Statistics]: existing Event has 265 ancestors and is cut-off event [2025-03-15 00:53:02,335 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2025-03-15 00:53:02,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][419], [322#true, 316#true, 349#true, 339#(= |#race~i_AB~0| 0), 325#true, 348#(= |#race~A~0| 0), 321#(= |#race~An~0| 0), 273#L58-8true, 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 354#(= |#race~B~0| 0), 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0), 375#true, 355#true]) [2025-03-15 00:53:02,336 INFO L294 olderBase$Statistics]: this new event has 311 ancestors and is cut-off event [2025-03-15 00:53:02,336 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2025-03-15 00:53:02,336 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2025-03-15 00:53:02,336 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2025-03-15 00:53:02,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][419], [322#true, 37#L58-9true, 316#true, 349#true, 339#(= |#race~i_AB~0| 0), 325#true, 348#(= |#race~A~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 354#(= |#race~B~0| 0), 313#true, 333#(= |#race~Bn~0| 0), 342#(= |#race~i_BA~0| 0), 355#true, 375#true]) [2025-03-15 00:53:02,337 INFO L294 olderBase$Statistics]: this new event has 312 ancestors and is cut-off event [2025-03-15 00:53:02,337 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2025-03-15 00:53:02,337 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-03-15 00:53:02,337 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-15 00:53:02,338 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][419], [322#true, 316#true, 349#true, 339#(= |#race~i_AB~0| 0), 325#true, 348#(= |#race~A~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 354#(= |#race~B~0| 0), 58#L58-10true, 313#true, 333#(= |#race~Bn~0| 0), 375#true, 355#true, 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:53:02,338 INFO L294 olderBase$Statistics]: this new event has 313 ancestors and is cut-off event [2025-03-15 00:53:02,338 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-15 00:53:02,338 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-03-15 00:53:02,338 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-03-15 00:53:02,338 INFO L124 PetriNetUnfolderBase]: 1524/6438 cut-off events. [2025-03-15 00:53:02,338 INFO L125 PetriNetUnfolderBase]: For 206781/220931 co-relation queries the response was YES. [2025-03-15 00:53:02,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22412 conditions, 6438 events. 1524/6438 cut-off events. For 206781/220931 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 51269 event pairs, 826 based on Foata normal form. 61/5657 useless extension candidates. Maximal degree in co-relation 18783. Up to 2217 conditions per place. [2025-03-15 00:53:02,385 INFO L140 encePairwiseOnDemand]: 301/318 looper letters, 119 selfloop transitions, 13 changer transitions 77/424 dead transitions. [2025-03-15 00:53:02,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 424 transitions, 3312 flow [2025-03-15 00:53:02,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 00:53:02,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 00:53:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2972 transitions. [2025-03-15 00:53:02,392 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7788259958071279 [2025-03-15 00:53:02,393 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, 14 predicate places. [2025-03-15 00:53:02,393 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 424 transitions, 3312 flow [2025-03-15 00:53:02,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 239.75) internal successors, (1918), 8 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:53:02,394 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:53:02,394 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:53:02,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 00:53:02,395 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:53:02,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:53:02,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1220876033, now seen corresponding path program 1 times [2025-03-15 00:53:02,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:53:02,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272298002] [2025-03-15 00:53:02,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:53:02,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:53:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:53:02,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 00:53:02,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:53:02,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272298002] [2025-03-15 00:53:02,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272298002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:53:02,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:53:02,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:53:02,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889693528] [2025-03-15 00:53:02,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:53:02,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:53:02,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:53:02,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:53:02,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:53:02,627 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 318 [2025-03-15 00:53:02,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 424 transitions, 3312 flow. Second operand has 8 states, 8 states have (on average 240.75) internal successors, (1926), 8 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:53:02,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:53:02,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 318 [2025-03-15 00:53:02,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:53:03,912 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][440], [139#L58-3true, 322#true, 397#(= ~i_AB~0 0), 316#true, 349#true, 339#(= |#race~i_AB~0| 0), 325#true, 348#(= |#race~A~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 354#(= |#race~B~0| 0), 357#(= ~i_AB~0 0), 313#true, 333#(= |#race~Bn~0| 0), 375#true, 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:53:03,912 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2025-03-15 00:53:03,912 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-03-15 00:53:03,912 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2025-03-15 00:53:03,912 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2025-03-15 00:53:04,006 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] thread1EXIT-->L81-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][440], [220#L58-4true, 322#true, 397#(= ~i_AB~0 0), 316#true, 349#true, 339#(= |#race~i_AB~0| 0), 325#true, 348#(= |#race~A~0| 0), 321#(= |#race~An~0| 0), 343#true, 4#L81-1true, 334#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 354#(= |#race~B~0| 0), 357#(= ~i_AB~0 0), 313#true, 333#(= |#race~Bn~0| 0), 375#true, 342#(= |#race~i_BA~0| 0)]) [2025-03-15 00:53:04,006 INFO L294 olderBase$Statistics]: this new event has 277 ancestors and is cut-off event [2025-03-15 00:53:04,006 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-03-15 00:53:04,006 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2025-03-15 00:53:04,006 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2025-03-15 00:53:04,159 INFO L124 PetriNetUnfolderBase]: 1849/8276 cut-off events. [2025-03-15 00:53:04,159 INFO L125 PetriNetUnfolderBase]: For 225501/242017 co-relation queries the response was YES. [2025-03-15 00:53:04,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30730 conditions, 8276 events. 1849/8276 cut-off events. For 225501/242017 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 70245 event pairs, 1013 based on Foata normal form. 212/7478 useless extension candidates. Maximal degree in co-relation 21320. Up to 2581 conditions per place. [2025-03-15 00:53:04,236 INFO L140 encePairwiseOnDemand]: 301/318 looper letters, 149 selfloop transitions, 20 changer transitions 116/504 dead transitions. [2025-03-15 00:53:04,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 504 transitions, 5130 flow [2025-03-15 00:53:04,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 00:53:04,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 00:53:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2953 transitions. [2025-03-15 00:53:04,242 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7738469601677149 [2025-03-15 00:53:04,243 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, 25 predicate places. [2025-03-15 00:53:04,243 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 504 transitions, 5130 flow [2025-03-15 00:53:04,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 240.75) internal successors, (1926), 8 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:53:04,244 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:53:04,244 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:53:04,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 00:53:04,244 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:53:04,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:53:04,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1671422214, now seen corresponding path program 1 times [2025-03-15 00:53:04,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:53:04,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984143547] [2025-03-15 00:53:04,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:53:04,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:53:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:53:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 00:53:04,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:53:04,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984143547] [2025-03-15 00:53:04,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984143547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:53:04,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:53:04,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:53:04,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530307099] [2025-03-15 00:53:04,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:53:04,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:53:04,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:53:04,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:53:04,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:53:04,450 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 318 [2025-03-15 00:53:04,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 504 transitions, 5130 flow. Second operand has 8 states, 8 states have (on average 240.875) internal successors, (1927), 8 states have internal predecessors, (1927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:53:04,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:53:04,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 318 [2025-03-15 00:53:04,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:53:05,955 INFO L124 PetriNetUnfolderBase]: 1708/6762 cut-off events. [2025-03-15 00:53:05,955 INFO L125 PetriNetUnfolderBase]: For 185233/196244 co-relation queries the response was YES. [2025-03-15 00:53:05,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27740 conditions, 6762 events. 1708/6762 cut-off events. For 185233/196244 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 53718 event pairs, 965 based on Foata normal form. 57/5943 useless extension candidates. Maximal degree in co-relation 21683. Up to 2313 conditions per place. [2025-03-15 00:53:05,995 INFO L140 encePairwiseOnDemand]: 301/318 looper letters, 132 selfloop transitions, 13 changer transitions 141/505 dead transitions. [2025-03-15 00:53:05,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 505 transitions, 5458 flow [2025-03-15 00:53:05,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 00:53:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 00:53:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2950 transitions. [2025-03-15 00:53:05,999 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7730607966457023 [2025-03-15 00:53:05,999 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, 36 predicate places. [2025-03-15 00:53:06,000 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 505 transitions, 5458 flow [2025-03-15 00:53:06,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 240.875) internal successors, (1927), 8 states have internal predecessors, (1927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:53:06,000 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:53:06,000 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:53:06,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 00:53:06,000 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:53:06,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:53:06,001 INFO L85 PathProgramCache]: Analyzing trace with hash -803948553, now seen corresponding path program 1 times [2025-03-15 00:53:06,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:53:06,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718451148] [2025-03-15 00:53:06,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:53:06,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:53:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:53:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 00:53:06,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:53:06,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718451148] [2025-03-15 00:53:06,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718451148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:53:06,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:53:06,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:53:06,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106910396] [2025-03-15 00:53:06,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:53:06,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:53:06,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:53:06,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:53:06,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:53:06,389 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 318 [2025-03-15 00:53:06,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 505 transitions, 5458 flow. Second operand has 6 states, 6 states have (on average 262.6666666666667) internal successors, (1576), 6 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:53:06,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:53:06,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 318 [2025-03-15 00:53:06,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:53:07,629 INFO L124 PetriNetUnfolderBase]: 1867/6687 cut-off events. [2025-03-15 00:53:07,629 INFO L125 PetriNetUnfolderBase]: For 180353/190029 co-relation queries the response was YES. [2025-03-15 00:53:07,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31723 conditions, 6687 events. 1867/6687 cut-off events. For 180353/190029 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 53886 event pairs, 466 based on Foata normal form. 5/5889 useless extension candidates. Maximal degree in co-relation 25506. Up to 2433 conditions per place. [2025-03-15 00:53:07,689 INFO L140 encePairwiseOnDemand]: 312/318 looper letters, 220 selfloop transitions, 10 changer transitions 152/633 dead transitions. [2025-03-15 00:53:07,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 633 transitions, 7768 flow [2025-03-15 00:53:07,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:53:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:53:07,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1662 transitions. [2025-03-15 00:53:07,692 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8710691823899371 [2025-03-15 00:53:07,692 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, 40 predicate places. [2025-03-15 00:53:07,692 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 633 transitions, 7768 flow [2025-03-15 00:53:07,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 262.6666666666667) internal successors, (1576), 6 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:53:07,693 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:53:07,693 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:53:07,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 00:53:07,693 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:53:07,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:53:07,694 INFO L85 PathProgramCache]: Analyzing trace with hash -424366224, now seen corresponding path program 1 times [2025-03-15 00:53:07,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:53:07,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230951154] [2025-03-15 00:53:07,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:53:07,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:53:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:53:08,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 00:53:08,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:53:08,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230951154] [2025-03-15 00:53:08,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230951154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:53:08,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:53:08,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:53:08,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202055863] [2025-03-15 00:53:08,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:53:08,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:53:08,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:53:08,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:53:08,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:53:08,028 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 318 [2025-03-15 00:53:08,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 633 transitions, 7768 flow. Second operand has 6 states, 6 states have (on average 262.8333333333333) internal successors, (1577), 6 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:53:08,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:53:08,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 318 [2025-03-15 00:53:08,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:53:09,447 INFO L124 PetriNetUnfolderBase]: 1927/7145 cut-off events. [2025-03-15 00:53:09,448 INFO L125 PetriNetUnfolderBase]: For 200214/209359 co-relation queries the response was YES. [2025-03-15 00:53:09,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35746 conditions, 7145 events. 1927/7145 cut-off events. For 200214/209359 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 57846 event pairs, 523 based on Foata normal form. 1/6410 useless extension candidates. Maximal degree in co-relation 28662. Up to 2433 conditions per place. [2025-03-15 00:53:09,502 INFO L140 encePairwiseOnDemand]: 312/318 looper letters, 306 selfloop transitions, 42 changer transitions 167/766 dead transitions. [2025-03-15 00:53:09,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 766 transitions, 11185 flow [2025-03-15 00:53:09,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:53:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:53:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1656 transitions. [2025-03-15 00:53:09,505 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8679245283018868 [2025-03-15 00:53:09,506 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, 44 predicate places. [2025-03-15 00:53:09,506 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 766 transitions, 11185 flow [2025-03-15 00:53:09,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 262.8333333333333) internal successors, (1577), 6 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:53:09,506 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:53:09,507 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:53:09,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 00:53:09,507 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:53:09,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:53:09,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1521744159, now seen corresponding path program 1 times [2025-03-15 00:53:09,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:53:09,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652681181] [2025-03-15 00:53:09,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:53:09,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:53:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:53:09,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 00:53:09,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:53:09,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652681181] [2025-03-15 00:53:09,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652681181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:53:09,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:53:09,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:53:09,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083577280] [2025-03-15 00:53:09,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:53:09,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:53:09,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:53:09,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:53:09,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:53:09,895 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 318 [2025-03-15 00:53:09,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 766 transitions, 11185 flow. Second operand has 6 states, 6 states have (on average 263.6666666666667) internal successors, (1582), 6 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:53:09,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:53:09,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 318 [2025-03-15 00:53:09,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:53:11,606 INFO L124 PetriNetUnfolderBase]: 1867/6974 cut-off events. [2025-03-15 00:53:11,607 INFO L125 PetriNetUnfolderBase]: For 217747/227164 co-relation queries the response was YES. [2025-03-15 00:53:11,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37774 conditions, 6974 events. 1867/6974 cut-off events. For 217747/227164 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 56441 event pairs, 486 based on Foata normal form. 1/6328 useless extension candidates. Maximal degree in co-relation 30404. Up to 2307 conditions per place. [2025-03-15 00:53:11,685 INFO L140 encePairwiseOnDemand]: 312/318 looper letters, 392 selfloop transitions, 42 changer transitions 167/860 dead transitions. [2025-03-15 00:53:11,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 860 transitions, 13579 flow [2025-03-15 00:53:11,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:53:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:53:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1656 transitions. [2025-03-15 00:53:11,688 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8679245283018868 [2025-03-15 00:53:11,689 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, 48 predicate places. [2025-03-15 00:53:11,689 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 860 transitions, 13579 flow [2025-03-15 00:53:11,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 263.6666666666667) internal successors, (1582), 6 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:53:11,689 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:53:11,690 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:53:11,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 00:53:11,690 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:53:11,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:53:11,691 INFO L85 PathProgramCache]: Analyzing trace with hash 983164728, now seen corresponding path program 1 times [2025-03-15 00:53:11,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:53:11,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511198801] [2025-03-15 00:53:11,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:53:11,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:53:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:53:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 00:53:12,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:53:12,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511198801] [2025-03-15 00:53:12,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511198801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:53:12,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:53:12,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:53:12,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564424880] [2025-03-15 00:53:12,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:53:12,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:53:12,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:53:12,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:53:12,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:53:12,109 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 318 [2025-03-15 00:53:12,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 860 transitions, 13579 flow. Second operand has 6 states, 6 states have (on average 263.8333333333333) internal successors, (1583), 6 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:53:12,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:53:12,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 318 [2025-03-15 00:53:12,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:53:13,584 INFO L124 PetriNetUnfolderBase]: 1798/6677 cut-off events. [2025-03-15 00:53:13,584 INFO L125 PetriNetUnfolderBase]: For 229986/239732 co-relation queries the response was YES. [2025-03-15 00:53:13,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38945 conditions, 6677 events. 1798/6677 cut-off events. For 229986/239732 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 53459 event pairs, 455 based on Foata normal form. 1/6138 useless extension candidates. Maximal degree in co-relation 31763. Up to 2154 conditions per place. [2025-03-15 00:53:13,637 INFO L140 encePairwiseOnDemand]: 312/318 looper letters, 462 selfloop transitions, 74 changer transitions 167/962 dead transitions. [2025-03-15 00:53:13,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 962 transitions, 17221 flow [2025-03-15 00:53:13,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:53:13,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:53:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1650 transitions. [2025-03-15 00:53:13,639 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8647798742138365 [2025-03-15 00:53:13,640 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, 52 predicate places. [2025-03-15 00:53:13,640 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 962 transitions, 17221 flow [2025-03-15 00:53:13,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 263.8333333333333) internal successors, (1583), 6 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:53:13,640 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:53:13,640 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:53:13,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 00:53:13,641 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:53:13,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:53:13,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1547770183, now seen corresponding path program 1 times [2025-03-15 00:53:13,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:53:13,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232184860] [2025-03-15 00:53:13,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:53:13,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:53:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:53:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 00:53:13,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:53:13,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232184860] [2025-03-15 00:53:13,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232184860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:53:13,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:53:13,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:53:13,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228302739] [2025-03-15 00:53:13,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:53:13,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:53:13,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:53:13,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:53:13,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:53:13,688 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 318 [2025-03-15 00:53:13,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 962 transitions, 17221 flow. Second operand has 3 states, 3 states have (on average 287.6666666666667) internal successors, (863), 3 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:53:13,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:53:13,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 318 [2025-03-15 00:53:13,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:53:15,115 INFO L124 PetriNetUnfolderBase]: 1802/6788 cut-off events. [2025-03-15 00:53:15,116 INFO L125 PetriNetUnfolderBase]: For 255449/267540 co-relation queries the response was YES. [2025-03-15 00:53:15,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40281 conditions, 6788 events. 1802/6788 cut-off events. For 255449/267540 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 54689 event pairs, 459 based on Foata normal form. 1/6249 useless extension candidates. Maximal degree in co-relation 32347. Up to 2175 conditions per place. [2025-03-15 00:53:15,200 INFO L140 encePairwiseOnDemand]: 315/318 looper letters, 120 selfloop transitions, 2 changer transitions 167/962 dead transitions. [2025-03-15 00:53:15,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 962 transitions, 17620 flow [2025-03-15 00:53:15,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:53:15,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:53:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 871 transitions. [2025-03-15 00:53:15,202 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9129979035639413 [2025-03-15 00:53:15,202 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, 53 predicate places. [2025-03-15 00:53:15,202 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 962 transitions, 17620 flow [2025-03-15 00:53:15,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.6666666666667) internal successors, (863), 3 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:53:15,203 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:53:15,203 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:53:15,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 00:53:15,203 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 00:53:15,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:53:15,205 INFO L85 PathProgramCache]: Analyzing trace with hash -975096320, now seen corresponding path program 1 times [2025-03-15 00:53:15,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:53:15,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866106248] [2025-03-15 00:53:15,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:53:15,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:53:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:53:15,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 00:53:15,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:53:15,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866106248] [2025-03-15 00:53:15,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866106248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:53:15,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:53:15,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:53:15,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56194688] [2025-03-15 00:53:15,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:53:15,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:53:15,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:53:15,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:53:15,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:53:15,254 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 318 [2025-03-15 00:53:15,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 962 transitions, 17620 flow. Second operand has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:53:15,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:53:15,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 318 [2025-03-15 00:53:15,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:53:16,620 INFO L124 PetriNetUnfolderBase]: 1806/6786 cut-off events. [2025-03-15 00:53:16,621 INFO L125 PetriNetUnfolderBase]: For 288169/300902 co-relation queries the response was YES. [2025-03-15 00:53:16,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41459 conditions, 6786 events. 1806/6786 cut-off events. For 288169/300902 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 54722 event pairs, 440 based on Foata normal form. 3/6262 useless extension candidates. Maximal degree in co-relation 33239. Up to 2179 conditions per place. [2025-03-15 00:53:16,666 INFO L140 encePairwiseOnDemand]: 315/318 looper letters, 0 selfloop transitions, 0 changer transitions 965/965 dead transitions. [2025-03-15 00:53:16,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 965 transitions, 18176 flow [2025-03-15 00:53:16,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:53:16,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:53:16,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 871 transitions. [2025-03-15 00:53:16,668 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9129979035639413 [2025-03-15 00:53:16,668 INFO L298 CegarLoopForPetriNet]: 310 programPoint places, 54 predicate places. [2025-03-15 00:53:16,668 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 965 transitions, 18176 flow [2025-03-15 00:53:16,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:53:16,675 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/array-eq-symm.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 00:53:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (59 of 60 remaining) [2025-03-15 00:53:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (58 of 60 remaining) [2025-03-15 00:53:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (57 of 60 remaining) [2025-03-15 00:53:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (56 of 60 remaining) [2025-03-15 00:53:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (55 of 60 remaining) [2025-03-15 00:53:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (54 of 60 remaining) [2025-03-15 00:53:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (53 of 60 remaining) [2025-03-15 00:53:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (52 of 60 remaining) [2025-03-15 00:53:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (51 of 60 remaining) [2025-03-15 00:53:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (50 of 60 remaining) [2025-03-15 00:53:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (49 of 60 remaining) [2025-03-15 00:53:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (48 of 60 remaining) [2025-03-15 00:53:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (47 of 60 remaining) [2025-03-15 00:53:16,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (46 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (45 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (44 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (43 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (42 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (41 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (40 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (39 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (38 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (37 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (36 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (32 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (31 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (29 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (28 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (27 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (23 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (22 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (21 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (20 of 60 remaining) [2025-03-15 00:53:16,720 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (19 of 60 remaining) [2025-03-15 00:53:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (18 of 60 remaining) [2025-03-15 00:53:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (17 of 60 remaining) [2025-03-15 00:53:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (16 of 60 remaining) [2025-03-15 00:53:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (15 of 60 remaining) [2025-03-15 00:53:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (14 of 60 remaining) [2025-03-15 00:53:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (13 of 60 remaining) [2025-03-15 00:53:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (12 of 60 remaining) [2025-03-15 00:53:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (11 of 60 remaining) [2025-03-15 00:53:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 60 remaining) [2025-03-15 00:53:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (9 of 60 remaining) [2025-03-15 00:53:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 60 remaining) [2025-03-15 00:53:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (7 of 60 remaining) [2025-03-15 00:53:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (6 of 60 remaining) [2025-03-15 00:53:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (5 of 60 remaining) [2025-03-15 00:53:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (4 of 60 remaining) [2025-03-15 00:53:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (3 of 60 remaining) [2025-03-15 00:53:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (2 of 60 remaining) [2025-03-15 00:53:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (1 of 60 remaining) [2025-03-15 00:53:16,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (0 of 60 remaining) [2025-03-15 00:53:16,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 00:53:16,722 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:53:16,725 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:53:16,725 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:53:16,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:53:16 BasicIcfg [2025-03-15 00:53:16,729 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:53:16,729 INFO L158 Benchmark]: Toolchain (without parser) took 22552.47ms. Allocated memory was 71.3MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 44.8MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2025-03-15 00:53:16,729 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 71.3MB. Free memory is still 33.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:53:16,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.08ms. Allocated memory is still 71.3MB. Free memory was 44.6MB in the beginning and 32.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 00:53:16,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.34ms. Allocated memory is still 71.3MB. Free memory was 32.3MB in the beginning and 30.5MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:53:16,730 INFO L158 Benchmark]: Boogie Preprocessor took 28.87ms. Allocated memory is still 71.3MB. Free memory was 30.5MB in the beginning and 28.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:53:16,730 INFO L158 Benchmark]: RCFGBuilder took 500.16ms. Allocated memory is still 71.3MB. Free memory was 28.7MB in the beginning and 30.1MB in the end (delta: -1.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2025-03-15 00:53:16,730 INFO L158 Benchmark]: TraceAbstraction took 21716.36ms. Allocated memory was 71.3MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 29.1MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2025-03-15 00:53:16,731 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 71.3MB. Free memory is still 33.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 261.08ms. Allocated memory is still 71.3MB. Free memory was 44.6MB in the beginning and 32.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.34ms. Allocated memory is still 71.3MB. Free memory was 32.3MB in the beginning and 30.5MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.87ms. Allocated memory is still 71.3MB. Free memory was 30.5MB in the beginning and 28.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 500.16ms. Allocated memory is still 71.3MB. Free memory was 28.7MB in the beginning and 30.1MB in the end (delta: -1.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 21716.36ms. Allocated memory was 71.3MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 29.1MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 434 locations, 60 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.5s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 704 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 704 mSDsluCounter, 907 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 447 mSDsCounter, 202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2229 IncrementalHoareTripleChecker+Invalid, 2431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 202 mSolverCounterUnsat, 460 mSDtfsCounter, 2229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18176occurred in iteration=23, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 2662 NumberOfCodeBlocks, 2662 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2639 ConstructedInterpolants, 0 QuantifiedInterpolants, 5208 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 14/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 34 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 00:53:16,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...