/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/chl-sre-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:58:34,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:58:34,106 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:58:34,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:58:34,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:58:34,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:58:34,132 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:58:34,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:58:34,132 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:58:34,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:58:34,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:58:34,133 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:58:34,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:58:34,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:58:34,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:58:34,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:58:34,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:58:34,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:58:34,134 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:58:34,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:58:34,134 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:58:34,134 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:58:34,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:58:34,134 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:58:34,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:58:34,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:58:34,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:58:34,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:58:34,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:58:34,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:58:34,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:58:34,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:58:34,135 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:58:34,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:58:34,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:58:34,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:58:34,384 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:58:34,384 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:58:34,385 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-sre-subst.wvr.c [2025-03-15 00:58:35,633 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ced1cd703/cbdfcbc99d144fc599ce66187ac1ad58/FLAG4f97090b9 [2025-03-15 00:58:35,821 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:58:35,821 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-sre-subst.wvr.c [2025-03-15 00:58:35,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ced1cd703/cbdfcbc99d144fc599ce66187ac1ad58/FLAG4f97090b9 [2025-03-15 00:58:35,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ced1cd703/cbdfcbc99d144fc599ce66187ac1ad58 [2025-03-15 00:58:35,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:58:35,844 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:58:35,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:58:35,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:58:35,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:58:35,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:58:35" (1/1) ... [2025-03-15 00:58:35,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335e3891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:35, skipping insertion in model container [2025-03-15 00:58:35,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:58:35" (1/1) ... [2025-03-15 00:58:35,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:58:36,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:58:36,014 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:58:36,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:58:36,037 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:58:36,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:36 WrapperNode [2025-03-15 00:58:36,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:58:36,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:58:36,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:58:36,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:58:36,042 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:58:36" (1/1) ... [2025-03-15 00:58:36,047 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:58:36" (1/1) ... [2025-03-15 00:58:36,064 INFO L138 Inliner]: procedures = 21, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 89 [2025-03-15 00:58:36,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:58:36,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:58:36,065 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:58:36,065 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:58:36,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:36" (1/1) ... [2025-03-15 00:58:36,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:36" (1/1) ... [2025-03-15 00:58:36,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:36" (1/1) ... [2025-03-15 00:58:36,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:36" (1/1) ... [2025-03-15 00:58:36,085 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:36" (1/1) ... [2025-03-15 00:58:36,086 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:36" (1/1) ... [2025-03-15 00:58:36,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:36" (1/1) ... [2025-03-15 00:58:36,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:36" (1/1) ... [2025-03-15 00:58:36,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:36" (1/1) ... [2025-03-15 00:58:36,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:58:36,097 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:58:36,097 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:58:36,097 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:58:36,098 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:36" (1/1) ... [2025-03-15 00:58:36,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:58:36,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:58:36,139 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:58:36,143 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:58:36,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:58:36,162 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 00:58:36,162 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 00:58:36,162 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 00:58:36,162 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 00:58:36,162 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 00:58:36,163 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 00:58:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:58:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:58:36,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:58:36,163 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:58:36,232 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:58:36,234 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:58:36,447 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:58:36,447 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:58:36,457 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:58:36,458 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:58:36,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:58:36 BoogieIcfgContainer [2025-03-15 00:58:36,458 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:58:36,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:58:36,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:58:36,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:58:36,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:58:35" (1/3) ... [2025-03-15 00:58:36,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c71d766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:58:36, skipping insertion in model container [2025-03-15 00:58:36,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:36" (2/3) ... [2025-03-15 00:58:36,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c71d766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:58:36, skipping insertion in model container [2025-03-15 00:58:36,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:58:36" (3/3) ... [2025-03-15 00:58:36,466 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-sre-subst.wvr.c [2025-03-15 00:58:36,476 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:58:36,477 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-sre-subst.wvr.c that has 4 procedures, 176 locations, 1 initial locations, 0 loop locations, and 20 error locations. [2025-03-15 00:58:36,477 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:58:36,539 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-15 00:58:36,579 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:58:36,587 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;@18846bf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:58:36,587 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-03-15 00:58:36,609 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:58:36,609 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-15 00:58:36,610 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:58:36,610 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:36,611 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] [2025-03-15 00:58:36,611 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-15 00:58:36,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:36,615 INFO L85 PathProgramCache]: Analyzing trace with hash -216439581, now seen corresponding path program 1 times [2025-03-15 00:58:36,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:36,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481453962] [2025-03-15 00:58:36,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:36,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:36,727 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:58:36,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:36,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481453962] [2025-03-15 00:58:36,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481453962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:36,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:36,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:36,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784464566] [2025-03-15 00:58:36,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:36,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:36,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:36,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:36,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:36,764 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 181 [2025-03-15 00:58:36,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 181 transitions, 383 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:36,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:36,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 181 [2025-03-15 00:58:36,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:36,913 INFO L124 PetriNetUnfolderBase]: 54/446 cut-off events. [2025-03-15 00:58:36,913 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-15 00:58:36,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 446 events. 54/446 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2150 event pairs, 39 based on Foata normal form. 3/347 useless extension candidates. Maximal degree in co-relation 447. Up to 85 conditions per place. [2025-03-15 00:58:36,926 INFO L140 encePairwiseOnDemand]: 175/181 looper letters, 15 selfloop transitions, 2 changer transitions 13/168 dead transitions. [2025-03-15 00:58:36,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 168 transitions, 388 flow [2025-03-15 00:58:36,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:36,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2025-03-15 00:58:36,940 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9171270718232044 [2025-03-15 00:58:36,943 INFO L298 CegarLoopForPetriNet]: 185 programPoint places, -9 predicate places. [2025-03-15 00:58:36,943 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 168 transitions, 388 flow [2025-03-15 00:58:36,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:36,944 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:36,944 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] [2025-03-15 00:58:36,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:58:36,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-15 00:58:36,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:36,945 INFO L85 PathProgramCache]: Analyzing trace with hash 724321985, now seen corresponding path program 1 times [2025-03-15 00:58:36,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:36,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965484835] [2025-03-15 00:58:36,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:36,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:36,990 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:58:36,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:36,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965484835] [2025-03-15 00:58:36,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965484835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:36,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:36,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:36,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276459410] [2025-03-15 00:58:36,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:36,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:36,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:36,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:36,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:36,994 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 181 [2025-03-15 00:58:36,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 168 transitions, 388 flow. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:36,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:36,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 181 [2025-03-15 00:58:36,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:37,185 INFO L124 PetriNetUnfolderBase]: 165/1039 cut-off events. [2025-03-15 00:58:37,185 INFO L125 PetriNetUnfolderBase]: For 375/429 co-relation queries the response was YES. [2025-03-15 00:58:37,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1550 conditions, 1039 events. 165/1039 cut-off events. For 375/429 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 7593 event pairs, 128 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1298. Up to 202 conditions per place. [2025-03-15 00:58:37,196 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 18 selfloop transitions, 2 changer transitions 13/167 dead transitions. [2025-03-15 00:58:37,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 167 transitions, 426 flow [2025-03-15 00:58:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:37,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:37,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2025-03-15 00:58:37,199 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9005524861878453 [2025-03-15 00:58:37,200 INFO L298 CegarLoopForPetriNet]: 185 programPoint places, -8 predicate places. [2025-03-15 00:58:37,200 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 167 transitions, 426 flow [2025-03-15 00:58:37,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:37,200 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:37,201 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] [2025-03-15 00:58:37,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:58:37,201 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-15 00:58:37,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:37,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1190117104, now seen corresponding path program 1 times [2025-03-15 00:58:37,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:37,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859644161] [2025-03-15 00:58:37,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:37,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:37,253 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:58:37,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:37,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859644161] [2025-03-15 00:58:37,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859644161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:37,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:37,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:37,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242372159] [2025-03-15 00:58:37,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:37,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:37,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:37,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:37,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:37,255 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 181 [2025-03-15 00:58:37,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 167 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 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:58:37,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:37,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 181 [2025-03-15 00:58:37,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:37,647 INFO L124 PetriNetUnfolderBase]: 926/3143 cut-off events. [2025-03-15 00:58:37,647 INFO L125 PetriNetUnfolderBase]: For 2378/2758 co-relation queries the response was YES. [2025-03-15 00:58:37,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5681 conditions, 3143 events. 926/3143 cut-off events. For 2378/2758 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 29994 event pairs, 812 based on Foata normal form. 0/2245 useless extension candidates. Maximal degree in co-relation 5367. Up to 1389 conditions per place. [2025-03-15 00:58:37,681 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 21 selfloop transitions, 2 changer transitions 13/166 dead transitions. [2025-03-15 00:58:37,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 166 transitions, 470 flow [2025-03-15 00:58:37,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2025-03-15 00:58:37,683 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8895027624309392 [2025-03-15 00:58:37,684 INFO L298 CegarLoopForPetriNet]: 185 programPoint places, -7 predicate places. [2025-03-15 00:58:37,684 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 166 transitions, 470 flow [2025-03-15 00:58:37,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 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:58:37,685 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:37,685 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] [2025-03-15 00:58:37,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:58:37,685 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-15 00:58:37,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:37,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1272458205, now seen corresponding path program 1 times [2025-03-15 00:58:37,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:37,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994279193] [2025-03-15 00:58:37,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:37,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:37,739 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:58:37,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:37,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994279193] [2025-03-15 00:58:37,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994279193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:37,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:37,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:37,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252869284] [2025-03-15 00:58:37,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:37,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:37,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:37,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:37,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:37,741 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 181 [2025-03-15 00:58:37,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 166 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 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:58:37,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:37,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 181 [2025-03-15 00:58:37,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:38,029 INFO L124 PetriNetUnfolderBase]: 944/3169 cut-off events. [2025-03-15 00:58:38,029 INFO L125 PetriNetUnfolderBase]: For 3770/4404 co-relation queries the response was YES. [2025-03-15 00:58:38,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5978 conditions, 3169 events. 944/3169 cut-off events. For 3770/4404 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 29673 event pairs, 822 based on Foata normal form. 0/2271 useless extension candidates. Maximal degree in co-relation 5188. Up to 1395 conditions per place. [2025-03-15 00:58:38,049 INFO L140 encePairwiseOnDemand]: 177/181 looper letters, 14 selfloop transitions, 2 changer transitions 13/168 dead transitions. [2025-03-15 00:58:38,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 168 transitions, 524 flow [2025-03-15 00:58:38,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:38,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2025-03-15 00:58:38,051 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9337016574585635 [2025-03-15 00:58:38,052 INFO L298 CegarLoopForPetriNet]: 185 programPoint places, -7 predicate places. [2025-03-15 00:58:38,052 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 168 transitions, 524 flow [2025-03-15 00:58:38,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 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:58:38,052 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:38,052 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] [2025-03-15 00:58:38,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:58:38,054 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-15 00:58:38,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:38,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1233357701, now seen corresponding path program 1 times [2025-03-15 00:58:38,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:38,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445582852] [2025-03-15 00:58:38,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:38,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:38,108 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:58:38,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:38,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445582852] [2025-03-15 00:58:38,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445582852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:38,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:38,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:38,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053979997] [2025-03-15 00:58:38,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:38,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:38,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:38,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:38,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:38,110 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 181 [2025-03-15 00:58:38,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 168 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 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:58:38,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:38,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 181 [2025-03-15 00:58:38,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:38,348 INFO L124 PetriNetUnfolderBase]: 731/2477 cut-off events. [2025-03-15 00:58:38,353 INFO L125 PetriNetUnfolderBase]: For 4590/5534 co-relation queries the response was YES. [2025-03-15 00:58:38,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5008 conditions, 2477 events. 731/2477 cut-off events. For 4590/5534 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 21976 event pairs, 469 based on Foata normal form. 1/1827 useless extension candidates. Maximal degree in co-relation 4251. Up to 1096 conditions per place. [2025-03-15 00:58:38,388 INFO L140 encePairwiseOnDemand]: 176/181 looper letters, 18 selfloop transitions, 2 changer transitions 13/169 dead transitions. [2025-03-15 00:58:38,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 169 transitions, 586 flow [2025-03-15 00:58:38,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:38,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:38,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2025-03-15 00:58:38,390 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9226519337016574 [2025-03-15 00:58:38,390 INFO L298 CegarLoopForPetriNet]: 185 programPoint places, -8 predicate places. [2025-03-15 00:58:38,391 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 169 transitions, 586 flow [2025-03-15 00:58:38,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 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:58:38,391 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:38,391 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] [2025-03-15 00:58:38,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:58:38,391 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-15 00:58:38,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:38,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1149712630, now seen corresponding path program 1 times [2025-03-15 00:58:38,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:38,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958867299] [2025-03-15 00:58:38,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:38,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:38,464 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:58:38,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:38,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958867299] [2025-03-15 00:58:38,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958867299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:38,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:38,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:38,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153646209] [2025-03-15 00:58:38,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:38,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:38,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:38,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:38,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:38,466 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 181 [2025-03-15 00:58:38,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 169 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:38,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:38,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 181 [2025-03-15 00:58:38,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:38,623 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][124], [26#L71-1true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 191#true, thread3Thread1of1ForFork2InUse, 19#$Ultimate##0true, 174#L48-2true, 203#true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:38,623 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2025-03-15 00:58:38,623 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-15 00:58:38,623 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-03-15 00:58:38,623 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-15 00:58:38,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][124], [26#L71-1true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 13#L54-1true, 191#true, thread3Thread1of1ForFork2InUse, 174#L48-2true, 203#true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:38,641 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-15 00:58:38,641 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-15 00:58:38,641 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-15 00:58:38,641 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-15 00:58:38,647 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][124], [26#L71-1true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 191#true, thread3Thread1of1ForFork2InUse, 109#L54-2true, 174#L48-2true, 188#true, 202#(= |#race~sponsored_1~0| 0), 203#true]) [2025-03-15 00:58:38,647 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-15 00:58:38,647 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-15 00:58:38,647 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-15 00:58:38,647 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-15 00:58:38,656 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][128], [171#L54-3true, 205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), thread3Thread1of1ForFork2InUse, 191#true, 174#L48-2true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:38,656 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is not cut-off event [2025-03-15 00:58:38,656 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is not cut-off event [2025-03-15 00:58:38,656 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-03-15 00:58:38,656 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is not cut-off event [2025-03-15 00:58:38,656 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][128], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 131#L54-4true, thread3Thread1of1ForFork2InUse, 191#true, 174#L48-2true, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:38,656 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-15 00:58:38,657 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-15 00:58:38,657 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-15 00:58:38,657 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-15 00:58:38,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][128], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 191#true, thread3Thread1of1ForFork2InUse, 129#L54-8true, 174#L48-2true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:38,665 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-03-15 00:58:38,665 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-15 00:58:38,665 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-15 00:58:38,665 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-15 00:58:38,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][128], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), thread3Thread1of1ForFork2InUse, 191#true, 93#L54-9true, 174#L48-2true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:38,670 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-15 00:58:38,671 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-15 00:58:38,672 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-15 00:58:38,672 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-15 00:58:38,692 INFO L124 PetriNetUnfolderBase]: 453/1932 cut-off events. [2025-03-15 00:58:38,692 INFO L125 PetriNetUnfolderBase]: For 4683/5803 co-relation queries the response was YES. [2025-03-15 00:58:38,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4365 conditions, 1932 events. 453/1932 cut-off events. For 4683/5803 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 16494 event pairs, 264 based on Foata normal form. 1/1644 useless extension candidates. Maximal degree in co-relation 2957. Up to 579 conditions per place. [2025-03-15 00:58:38,717 INFO L140 encePairwiseOnDemand]: 175/181 looper letters, 23 selfloop transitions, 2 changer transitions 13/170 dead transitions. [2025-03-15 00:58:38,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 170 transitions, 673 flow [2025-03-15 00:58:38,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:38,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2025-03-15 00:58:38,719 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9116022099447514 [2025-03-15 00:58:38,719 INFO L298 CegarLoopForPetriNet]: 185 programPoint places, -10 predicate places. [2025-03-15 00:58:38,719 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 170 transitions, 673 flow [2025-03-15 00:58:38,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:38,719 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:38,720 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] [2025-03-15 00:58:38,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:58:38,720 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-15 00:58:38,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:38,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1036086572, now seen corresponding path program 1 times [2025-03-15 00:58:38,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:38,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726267549] [2025-03-15 00:58:38,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:38,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:38,789 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:58:38,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:38,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726267549] [2025-03-15 00:58:38,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726267549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:38,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:38,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:38,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764665913] [2025-03-15 00:58:38,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:38,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:38,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:38,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:38,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:38,791 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 181 [2025-03-15 00:58:38,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 170 transitions, 673 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 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:58:38,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:38,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 181 [2025-03-15 00:58:38,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:38,982 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][133], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 38#L48-9true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), thread3Thread1of1ForFork2InUse, 13#L54-1true, 206#true, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:38,982 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-15 00:58:38,982 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-15 00:58:38,982 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-15 00:58:38,982 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-15 00:58:38,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][133], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 109#L54-2true, 38#L48-9true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 206#true, thread3Thread1of1ForFork2InUse, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:38,983 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-15 00:58:38,984 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-15 00:58:38,984 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-15 00:58:38,984 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-15 00:58:38,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([459] thread2EXIT-->L72: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][135], [205#(= |#race~sponsored_2~0| 0), 194#true, thread2Thread1of1ForFork1NotInUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 79#L72true, thread3Thread1of1ForFork2InUse, 191#true, 206#true, 109#L54-2true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:38,998 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-15 00:58:38,998 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-03-15 00:58:38,998 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-03-15 00:58:38,998 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:58:39,007 INFO L124 PetriNetUnfolderBase]: 538/2186 cut-off events. [2025-03-15 00:58:39,007 INFO L125 PetriNetUnfolderBase]: For 8811/10156 co-relation queries the response was YES. [2025-03-15 00:58:39,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5337 conditions, 2186 events. 538/2186 cut-off events. For 8811/10156 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 19150 event pairs, 254 based on Foata normal form. 13/1896 useless extension candidates. Maximal degree in co-relation 4530. Up to 697 conditions per place. [2025-03-15 00:58:39,020 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 21 selfloop transitions, 2 changer transitions 13/172 dead transitions. [2025-03-15 00:58:39,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 172 transitions, 768 flow [2025-03-15 00:58:39,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:39,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2025-03-15 00:58:39,022 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9355432780847146 [2025-03-15 00:58:39,024 INFO L298 CegarLoopForPetriNet]: 185 programPoint places, -9 predicate places. [2025-03-15 00:58:39,024 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 172 transitions, 768 flow [2025-03-15 00:58:39,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 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:58:39,024 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:39,024 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] [2025-03-15 00:58:39,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:58:39,025 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-15 00:58:39,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:39,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1472827793, now seen corresponding path program 1 times [2025-03-15 00:58:39,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:39,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796552470] [2025-03-15 00:58:39,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:39,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:39,066 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:58:39,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:39,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796552470] [2025-03-15 00:58:39,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796552470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:39,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:39,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:39,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898949768] [2025-03-15 00:58:39,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:39,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:39,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:39,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:39,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:39,068 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 181 [2025-03-15 00:58:39,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 172 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 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:58:39,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:39,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 181 [2025-03-15 00:58:39,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:39,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([433] L54-2-->L54-3: Formula: (= |v_#race~sponsored_2~0_10| 0) InVars {} OutVars{#race~sponsored_2~0=|v_#race~sponsored_2~0_10|} AuxVars[] AssignedVars[#race~sponsored_2~0][119], [132#L42-9true, 205#(= |#race~sponsored_2~0| 0), 20#L70-4true, 162#L48-3true, 191#true, 209#true, 171#L54-3true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, 206#true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,146 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is not cut-off event [2025-03-15 00:58:39,146 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is not cut-off event [2025-03-15 00:58:39,147 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is not cut-off event [2025-03-15 00:58:39,147 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is not cut-off event [2025-03-15 00:58:39,147 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([433] L54-2-->L54-3: Formula: (= |v_#race~sponsored_2~0_10| 0) InVars {} OutVars{#race~sponsored_2~0=|v_#race~sponsored_2~0_10|} AuxVars[] AssignedVars[#race~sponsored_2~0][119], [132#L42-9true, 205#(= |#race~sponsored_2~0| 0), 20#L70-4true, 191#true, 118#L48-4true, 209#true, 171#L54-3true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, 206#true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,147 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2025-03-15 00:58:39,147 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-03-15 00:58:39,147 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-03-15 00:58:39,147 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-03-15 00:58:39,168 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([433] L54-2-->L54-3: Formula: (= |v_#race~sponsored_2~0_10| 0) InVars {} OutVars{#race~sponsored_2~0=|v_#race~sponsored_2~0_10|} AuxVars[] AssignedVars[#race~sponsored_2~0][119], [205#(= |#race~sponsored_2~0| 0), 132#L42-9true, 20#L70-4true, 191#true, 209#true, 115#L48-8true, 171#L54-3true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, 206#true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,168 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2025-03-15 00:58:39,168 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-15 00:58:39,168 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-15 00:58:39,168 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-15 00:58:39,177 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([433] L54-2-->L54-3: Formula: (= |v_#race~sponsored_2~0_10| 0) InVars {} OutVars{#race~sponsored_2~0=|v_#race~sponsored_2~0_10|} AuxVars[] AssignedVars[#race~sponsored_2~0][119], [132#L42-9true, 205#(= |#race~sponsored_2~0| 0), 20#L70-4true, 191#true, 209#true, 38#L48-9true, 171#L54-3true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, 206#true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,177 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-03-15 00:58:39,177 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-03-15 00:58:39,177 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-03-15 00:58:39,177 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-03-15 00:58:39,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][137], [26#L71-1true, 191#true, 174#L48-2true, 209#true, 203#true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, 13#L54-1true, thread3Thread1of1ForFork2InUse, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,207 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2025-03-15 00:58:39,207 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-15 00:58:39,208 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-15 00:58:39,208 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-03-15 00:58:39,211 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 118#L48-4true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, 13#L54-1true, thread3Thread1of1ForFork2InUse, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,212 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-15 00:58:39,212 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-15 00:58:39,212 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-15 00:58:39,212 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-15 00:58:39,219 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][137], [26#L71-1true, 191#true, 109#L54-2true, 174#L48-2true, 203#true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), thread3Thread1of1ForFork2InUse, 206#true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,219 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-15 00:58:39,219 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-15 00:58:39,219 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-15 00:58:39,219 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-15 00:58:39,224 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 109#L54-2true, 118#L48-4true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, thread3Thread1of1ForFork2InUse, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,224 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-15 00:58:39,225 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-15 00:58:39,225 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-15 00:58:39,225 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-15 00:58:39,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 162#L48-3true, 191#true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 13#L54-1true, 206#true, thread3Thread1of1ForFork2InUse, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,228 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is not cut-off event [2025-03-15 00:58:39,228 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is not cut-off event [2025-03-15 00:58:39,228 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is not cut-off event [2025-03-15 00:58:39,228 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is not cut-off event [2025-03-15 00:58:39,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 162#L48-3true, 191#true, 109#L54-2true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 206#true, thread3Thread1of1ForFork2InUse, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,228 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-15 00:58:39,228 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-15 00:58:39,228 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-15 00:58:39,228 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-15 00:58:39,228 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 118#L48-4true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 13#L54-1true, thread3Thread1of1ForFork2InUse, 206#true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,228 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-15 00:58:39,228 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-15 00:58:39,228 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-15 00:58:39,229 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-15 00:58:39,229 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-15 00:58:39,230 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 174#L48-2true, 209#true, 171#L54-3true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 206#true, thread3Thread1of1ForFork2InUse, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,230 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-15 00:58:39,230 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-15 00:58:39,230 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-15 00:58:39,230 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-15 00:58:39,233 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 209#true, 38#L48-9true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, 13#L54-1true, thread3Thread1of1ForFork2InUse, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,233 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-03-15 00:58:39,233 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-15 00:58:39,233 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-15 00:58:39,233 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-15 00:58:39,233 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 209#true, 115#L48-8true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 13#L54-1true, 206#true, thread3Thread1of1ForFork2InUse, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,233 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-15 00:58:39,233 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-15 00:58:39,233 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-15 00:58:39,234 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-15 00:58:39,238 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 131#L54-4true, 191#true, 174#L48-2true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, thread3Thread1of1ForFork2InUse, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,239 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-15 00:58:39,239 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-15 00:58:39,239 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-15 00:58:39,239 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-15 00:58:39,242 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 109#L54-2true, 209#true, 38#L48-9true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, thread3Thread1of1ForFork2InUse, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,242 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-15 00:58:39,242 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-15 00:58:39,242 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-15 00:58:39,242 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-15 00:58:39,242 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 109#L54-2true, 209#true, 115#L48-8true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 206#true, thread3Thread1of1ForFork2InUse, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,242 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-03-15 00:58:39,242 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-15 00:58:39,242 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-15 00:58:39,242 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-15 00:58:39,245 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 209#true, 115#L48-8true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 13#L54-1true, thread3Thread1of1ForFork2InUse, 206#true, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,245 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-15 00:58:39,245 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-15 00:58:39,245 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-15 00:58:39,245 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-15 00:58:39,245 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-15 00:58:39,246 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 109#L54-2true, 118#L48-4true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 206#true, thread3Thread1of1ForFork2InUse, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,246 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is not cut-off event [2025-03-15 00:58:39,246 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is not cut-off event [2025-03-15 00:58:39,246 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is not cut-off event [2025-03-15 00:58:39,246 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is not cut-off event [2025-03-15 00:58:39,246 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is not cut-off event [2025-03-15 00:58:39,246 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 109#L54-2true, 209#true, 115#L48-8true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, thread3Thread1of1ForFork2InUse, 206#true, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,246 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-03-15 00:58:39,246 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-15 00:58:39,246 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-15 00:58:39,246 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-15 00:58:39,246 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-15 00:58:39,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 109#L54-2true, 97#L48-12true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), thread3Thread1of1ForFork2InUse, 206#true, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,246 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-15 00:58:39,246 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-15 00:58:39,246 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-15 00:58:39,246 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-15 00:58:39,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][135], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 94#L48-14true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 13#L54-1true, thread3Thread1of1ForFork2InUse, 206#true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,250 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2025-03-15 00:58:39,250 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-03-15 00:58:39,250 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-15 00:58:39,250 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-15 00:58:39,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][135], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 51#L48-13true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 13#L54-1true, 206#true, thread3Thread1of1ForFork2InUse, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,250 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-15 00:58:39,250 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-15 00:58:39,250 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-15 00:58:39,250 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-15 00:58:39,251 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, 13#L54-1true, thread3Thread1of1ForFork2InUse, 92#L50true, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,251 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2025-03-15 00:58:39,251 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-03-15 00:58:39,251 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-03-15 00:58:39,251 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-15 00:58:39,251 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 97#L48-12true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 206#true, 13#L54-1true, thread3Thread1of1ForFork2InUse, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,251 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-15 00:58:39,251 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-15 00:58:39,251 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-15 00:58:39,251 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-15 00:58:39,252 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 209#true, 38#L48-9true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 13#L54-1true, 206#true, thread3Thread1of1ForFork2InUse, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,252 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-03-15 00:58:39,252 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-15 00:58:39,252 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-15 00:58:39,252 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-15 00:58:39,252 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-15 00:58:39,257 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][135], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 109#L54-2true, 94#L48-14true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 206#true, thread3Thread1of1ForFork2InUse, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,257 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2025-03-15 00:58:39,257 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-15 00:58:39,257 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-03-15 00:58:39,257 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-15 00:58:39,258 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][135], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 109#L54-2true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 51#L48-13true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 206#true, thread3Thread1of1ForFork2InUse, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,258 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2025-03-15 00:58:39,258 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-03-15 00:58:39,258 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-15 00:58:39,258 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-15 00:58:39,258 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 109#L54-2true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 206#true, thread3Thread1of1ForFork2InUse, 92#L50true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,258 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2025-03-15 00:58:39,258 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-03-15 00:58:39,258 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-03-15 00:58:39,258 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-03-15 00:58:39,258 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 109#L54-2true, 97#L48-12true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 206#true, thread3Thread1of1ForFork2InUse, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,258 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-15 00:58:39,258 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-15 00:58:39,258 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-15 00:58:39,258 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-15 00:58:39,258 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-15 00:58:39,260 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 97#L48-12true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 13#L54-1true, thread3Thread1of1ForFork2InUse, 206#true, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,260 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-15 00:58:39,260 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-15 00:58:39,260 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-15 00:58:39,260 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-15 00:58:39,260 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-15 00:58:39,262 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 109#L54-2true, 209#true, 38#L48-9true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), thread3Thread1of1ForFork2InUse, 206#true, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,262 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-15 00:58:39,262 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-15 00:58:39,262 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-15 00:58:39,262 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-15 00:58:39,262 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-15 00:58:39,265 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 174#L48-2true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, thread3Thread1of1ForFork2InUse, 129#L54-8true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,265 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is not cut-off event [2025-03-15 00:58:39,265 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2025-03-15 00:58:39,265 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is not cut-off event [2025-03-15 00:58:39,265 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is not cut-off event [2025-03-15 00:58:39,265 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 174#L48-2true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), thread3Thread1of1ForFork2InUse, 206#true, 93#L54-9true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,265 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-15 00:58:39,265 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-15 00:58:39,265 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-15 00:58:39,265 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-15 00:58:39,269 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([458] thread1EXIT-->L71-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[][135], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 51#L48-13true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 13#L54-1true, 206#true, thread3Thread1of1ForFork2InUse, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,269 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is not cut-off event [2025-03-15 00:58:39,269 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is not cut-off event [2025-03-15 00:58:39,269 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2025-03-15 00:58:39,269 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2025-03-15 00:58:39,269 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2025-03-15 00:58:39,270 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([458] thread1EXIT-->L71-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[][135], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 94#L48-14true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, 13#L54-1true, thread3Thread1of1ForFork2InUse, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,270 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2025-03-15 00:58:39,270 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-03-15 00:58:39,270 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-15 00:58:39,270 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-15 00:58:39,270 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-15 00:58:39,270 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([458] thread1EXIT-->L71-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[][135], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 109#L54-2true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 51#L48-13true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, thread3Thread1of1ForFork2InUse, 206#true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,270 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2025-03-15 00:58:39,270 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-03-15 00:58:39,270 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-15 00:58:39,270 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-15 00:58:39,270 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-15 00:58:39,276 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([458] thread1EXIT-->L71-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[][135], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 109#L54-2true, 94#L48-14true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 206#true, thread3Thread1of1ForFork2InUse, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,277 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is not cut-off event [2025-03-15 00:58:39,277 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is not cut-off event [2025-03-15 00:58:39,277 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is not cut-off event [2025-03-15 00:58:39,277 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is not cut-off event [2025-03-15 00:58:39,277 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is not cut-off event [2025-03-15 00:58:39,277 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 109#L54-2true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, thread3Thread1of1ForFork2InUse, 206#true, 202#(= |#race~sponsored_1~0| 0), 188#true, 92#L50true]) [2025-03-15 00:58:39,277 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2025-03-15 00:58:39,277 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-03-15 00:58:39,277 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-03-15 00:58:39,277 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-03-15 00:58:39,277 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-03-15 00:58:39,278 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 13#L54-1true, 206#true, thread3Thread1of1ForFork2InUse, 202#(= |#race~sponsored_1~0| 0), 188#true, 92#L50true]) [2025-03-15 00:58:39,278 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2025-03-15 00:58:39,278 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-03-15 00:58:39,278 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-03-15 00:58:39,278 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-03-15 00:58:39,278 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-15 00:58:39,300 INFO L124 PetriNetUnfolderBase]: 780/2706 cut-off events. [2025-03-15 00:58:39,300 INFO L125 PetriNetUnfolderBase]: For 24657/28403 co-relation queries the response was YES. [2025-03-15 00:58:39,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8138 conditions, 2706 events. 780/2706 cut-off events. For 24657/28403 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 24293 event pairs, 438 based on Foata normal form. 5/2227 useless extension candidates. Maximal degree in co-relation 5682. Up to 981 conditions per place. [2025-03-15 00:58:39,348 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 28 selfloop transitions, 2 changer transitions 13/175 dead transitions. [2025-03-15 00:58:39,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 175 transitions, 902 flow [2025-03-15 00:58:39,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:39,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:39,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2025-03-15 00:58:39,350 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9244935543278084 [2025-03-15 00:58:39,351 INFO L298 CegarLoopForPetriNet]: 185 programPoint places, -8 predicate places. [2025-03-15 00:58:39,351 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 175 transitions, 902 flow [2025-03-15 00:58:39,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 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:58:39,352 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:39,352 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:58:39,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:58:39,352 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-15 00:58:39,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:39,352 INFO L85 PathProgramCache]: Analyzing trace with hash 949873319, now seen corresponding path program 1 times [2025-03-15 00:58:39,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:39,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569297405] [2025-03-15 00:58:39,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:39,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:39,399 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:58:39,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:39,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569297405] [2025-03-15 00:58:39,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569297405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:39,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:39,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:39,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264142449] [2025-03-15 00:58:39,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:39,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:39,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:39,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:39,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:39,400 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 181 [2025-03-15 00:58:39,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 175 transitions, 902 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 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:58:39,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:39,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 181 [2025-03-15 00:58:39,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:39,577 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][137], [72#L54-12true, 205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 51#L48-13true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 206#true, thread3Thread1of1ForFork2InUse, 188#true, 202#(= |#race~sponsored_1~0| 0), 212#true]) [2025-03-15 00:58:39,577 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-03-15 00:58:39,577 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-03-15 00:58:39,577 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:58:39,577 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-03-15 00:58:39,578 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][137], [72#L54-12true, 205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 94#L48-14true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, thread3Thread1of1ForFork2InUse, 206#true, 188#true, 202#(= |#race~sponsored_1~0| 0), 212#true]) [2025-03-15 00:58:39,578 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-03-15 00:58:39,578 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-15 00:58:39,578 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-15 00:58:39,578 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:58:39,579 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][138], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 214#(= |thread3Thread1of1ForFork2_#t~nondet6| |#race~result_5~0|), 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 51#L48-13true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 206#true, thread3Thread1of1ForFork2InUse, 176#L54-13true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,579 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-03-15 00:58:39,579 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-15 00:58:39,579 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-15 00:58:39,579 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:58:39,581 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][138], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 94#L48-14true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 214#(= |thread3Thread1of1ForFork2_#t~nondet6| |#race~result_5~0|), 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, thread3Thread1of1ForFork2InUse, 176#L54-13true, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,581 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-15 00:58:39,582 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:58:39,582 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:58:39,582 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-15 00:58:39,582 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][138], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 10#L54-14true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 214#(= |thread3Thread1of1ForFork2_#t~nondet6| |#race~result_5~0|), 51#L48-13true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 206#true, thread3Thread1of1ForFork2InUse, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,582 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-15 00:58:39,582 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:58:39,582 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-15 00:58:39,582 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:58:39,583 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][134], [72#L54-12true, 26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, thread3Thread1of1ForFork2InUse, 202#(= |#race~sponsored_1~0| 0), 92#L50true, 188#true, 212#true]) [2025-03-15 00:58:39,583 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-03-15 00:58:39,583 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-15 00:58:39,583 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:58:39,583 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:58:39,583 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][138], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 94#L48-14true, 10#L54-14true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 214#(= |thread3Thread1of1ForFork2_#t~nondet6| |#race~result_5~0|), 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, thread3Thread1of1ForFork2InUse, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,583 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-03-15 00:58:39,583 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:58:39,583 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:58:39,583 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-15 00:58:39,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 209#true, 214#(= |thread3Thread1of1ForFork2_#t~nondet6| |#race~result_5~0|), 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, thread3Thread1of1ForFork2InUse, 176#L54-13true, 188#true, 92#L50true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,584 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2025-03-15 00:58:39,584 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-15 00:58:39,584 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-15 00:58:39,584 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-15 00:58:39,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][137], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 80#L56true, 191#true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 51#L48-13true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 206#true, thread3Thread1of1ForFork2InUse, 188#true, 202#(= |#race~sponsored_1~0| 0), 212#true]) [2025-03-15 00:58:39,584 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2025-03-15 00:58:39,584 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-15 00:58:39,584 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-15 00:58:39,584 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-15 00:58:39,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 209#true, 10#L54-14true, 214#(= |thread3Thread1of1ForFork2_#t~nondet6| |#race~result_5~0|), 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 206#true, thread3Thread1of1ForFork2InUse, 92#L50true, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,585 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-03-15 00:58:39,585 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-15 00:58:39,585 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-15 00:58:39,585 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-15 00:58:39,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][137], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 80#L56true, 191#true, 94#L48-14true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 206#true, thread3Thread1of1ForFork2InUse, 188#true, 202#(= |#race~sponsored_1~0| 0), 212#true]) [2025-03-15 00:58:39,585 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-03-15 00:58:39,585 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-15 00:58:39,585 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-15 00:58:39,585 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-15 00:58:39,586 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][134], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 80#L56true, 191#true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, thread3Thread1of1ForFork2InUse, 188#true, 202#(= |#race~sponsored_1~0| 0), 92#L50true, 212#true]) [2025-03-15 00:58:39,586 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-03-15 00:58:39,586 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-15 00:58:39,586 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-15 00:58:39,586 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-03-15 00:58:39,599 INFO L124 PetriNetUnfolderBase]: 823/2790 cut-off events. [2025-03-15 00:58:39,599 INFO L125 PetriNetUnfolderBase]: For 30754/32929 co-relation queries the response was YES. [2025-03-15 00:58:39,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9517 conditions, 2790 events. 823/2790 cut-off events. For 30754/32929 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 25491 event pairs, 346 based on Foata normal form. 1/2416 useless extension candidates. Maximal degree in co-relation 8443. Up to 993 conditions per place. [2025-03-15 00:58:39,624 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 30 selfloop transitions, 2 changer transitions 13/177 dead transitions. [2025-03-15 00:58:39,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 177 transitions, 1029 flow [2025-03-15 00:58:39,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:39,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:39,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2025-03-15 00:58:39,626 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9244935543278084 [2025-03-15 00:58:39,627 INFO L298 CegarLoopForPetriNet]: 185 programPoint places, -7 predicate places. [2025-03-15 00:58:39,627 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 177 transitions, 1029 flow [2025-03-15 00:58:39,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 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:58:39,627 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:39,627 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] [2025-03-15 00:58:39,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:58:39,627 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-15 00:58:39,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:39,628 INFO L85 PathProgramCache]: Analyzing trace with hash 503862112, now seen corresponding path program 1 times [2025-03-15 00:58:39,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:39,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190601736] [2025-03-15 00:58:39,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:39,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:39,688 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:58:39,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:39,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190601736] [2025-03-15 00:58:39,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190601736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:39,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:39,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:39,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563290036] [2025-03-15 00:58:39,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:39,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:39,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:39,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:39,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:39,689 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 181 [2025-03-15 00:58:39,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 177 transitions, 1029 flow. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 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:58:39,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:39,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 181 [2025-03-15 00:58:39,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:39,874 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][137], [72#L54-12true, 205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 215#true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 51#L48-13true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, thread3Thread1of1ForFork2InUse, 202#(= |#race~sponsored_1~0| 0), 188#true, 212#true]) [2025-03-15 00:58:39,874 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-03-15 00:58:39,874 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-03-15 00:58:39,874 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:58:39,874 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-03-15 00:58:39,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][137], [72#L54-12true, 205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 215#true, 94#L48-14true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, thread3Thread1of1ForFork2InUse, 188#true, 202#(= |#race~sponsored_1~0| 0), 212#true]) [2025-03-15 00:58:39,875 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-03-15 00:58:39,875 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-15 00:58:39,875 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-15 00:58:39,875 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:58:39,876 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][138], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 215#true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 214#(= |thread3Thread1of1ForFork2_#t~nondet6| |#race~result_5~0|), 51#L48-13true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, thread3Thread1of1ForFork2InUse, 176#L54-13true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,876 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-03-15 00:58:39,876 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-15 00:58:39,876 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-15 00:58:39,876 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:58:39,877 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][138], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 215#true, 94#L48-14true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 214#(= |thread3Thread1of1ForFork2_#t~nondet6| |#race~result_5~0|), 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, thread3Thread1of1ForFork2InUse, 176#L54-13true, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,877 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-15 00:58:39,877 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:58:39,877 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:58:39,877 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-15 00:58:39,877 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][138], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 215#true, 10#L54-14true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 214#(= |thread3Thread1of1ForFork2_#t~nondet6| |#race~result_5~0|), 51#L48-13true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, thread3Thread1of1ForFork2InUse, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,877 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-15 00:58:39,877 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:58:39,877 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-15 00:58:39,877 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:58:39,878 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][134], [72#L54-12true, 205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 215#true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, thread3Thread1of1ForFork2InUse, 202#(= |#race~sponsored_1~0| 0), 92#L50true, 188#true, 212#true]) [2025-03-15 00:58:39,878 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-03-15 00:58:39,878 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-15 00:58:39,878 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:58:39,878 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:58:39,878 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][138], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 215#true, 94#L48-14true, 10#L54-14true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 214#(= |thread3Thread1of1ForFork2_#t~nondet6| |#race~result_5~0|), 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 206#true, thread3Thread1of1ForFork2InUse, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,878 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-03-15 00:58:39,878 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:58:39,879 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-15 00:58:39,879 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:58:39,879 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 215#true, 209#true, 214#(= |thread3Thread1of1ForFork2_#t~nondet6| |#race~result_5~0|), 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, thread3Thread1of1ForFork2InUse, 176#L54-13true, 92#L50true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:39,879 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2025-03-15 00:58:39,879 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-15 00:58:39,879 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-15 00:58:39,879 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-15 00:58:39,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][137], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 80#L56true, 191#true, 215#true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 51#L48-13true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, thread3Thread1of1ForFork2InUse, 202#(= |#race~sponsored_1~0| 0), 188#true, 212#true]) [2025-03-15 00:58:39,880 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2025-03-15 00:58:39,880 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-15 00:58:39,880 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-15 00:58:39,880 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-15 00:58:39,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 215#true, 209#true, 10#L54-14true, 214#(= |thread3Thread1of1ForFork2_#t~nondet6| |#race~result_5~0|), 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, thread3Thread1of1ForFork2InUse, 188#true, 92#L50true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:39,880 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-03-15 00:58:39,880 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-15 00:58:39,880 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-15 00:58:39,880 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-15 00:58:39,881 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][137], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 80#L56true, 191#true, 215#true, 94#L48-14true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 206#true, thread3Thread1of1ForFork2InUse, 188#true, 202#(= |#race~sponsored_1~0| 0), 212#true]) [2025-03-15 00:58:39,881 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-03-15 00:58:39,881 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-15 00:58:39,881 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-15 00:58:39,881 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-15 00:58:39,882 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][134], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 80#L56true, 191#true, 215#true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 206#true, thread3Thread1of1ForFork2InUse, 92#L50true, 188#true, 202#(= |#race~sponsored_1~0| 0), 212#true]) [2025-03-15 00:58:39,882 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-03-15 00:58:39,882 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-15 00:58:39,882 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-15 00:58:39,882 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-03-15 00:58:39,889 INFO L124 PetriNetUnfolderBase]: 823/2789 cut-off events. [2025-03-15 00:58:39,890 INFO L125 PetriNetUnfolderBase]: For 37191/39601 co-relation queries the response was YES. [2025-03-15 00:58:39,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9997 conditions, 2789 events. 823/2789 cut-off events. For 37191/39601 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 25580 event pairs, 346 based on Foata normal form. 0/2415 useless extension candidates. Maximal degree in co-relation 8875. Up to 993 conditions per place. [2025-03-15 00:58:39,912 INFO L140 encePairwiseOnDemand]: 179/181 looper letters, 26 selfloop transitions, 1 changer transitions 13/176 dead transitions. [2025-03-15 00:58:39,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 176 transitions, 1079 flow [2025-03-15 00:58:39,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:39,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2025-03-15 00:58:39,914 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9373848987108656 [2025-03-15 00:58:39,915 INFO L298 CegarLoopForPetriNet]: 185 programPoint places, -6 predicate places. [2025-03-15 00:58:39,915 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 176 transitions, 1079 flow [2025-03-15 00:58:39,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 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:58:39,916 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:39,916 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] [2025-03-15 00:58:39,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:58:39,916 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-15 00:58:39,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:39,917 INFO L85 PathProgramCache]: Analyzing trace with hash -397319985, now seen corresponding path program 1 times [2025-03-15 00:58:39,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:39,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564792752] [2025-03-15 00:58:39,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:39,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:39,961 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:58:39,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:39,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564792752] [2025-03-15 00:58:39,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564792752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:39,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:39,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:39,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493710556] [2025-03-15 00:58:39,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:39,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:39,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:39,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:39,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:39,962 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 181 [2025-03-15 00:58:39,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 176 transitions, 1079 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 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:58:39,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:39,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 181 [2025-03-15 00:58:39,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:40,192 INFO L124 PetriNetUnfolderBase]: 805/2494 cut-off events. [2025-03-15 00:58:40,192 INFO L125 PetriNetUnfolderBase]: For 52593/56775 co-relation queries the response was YES. [2025-03-15 00:58:40,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9751 conditions, 2494 events. 805/2494 cut-off events. For 52593/56775 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 22213 event pairs, 250 based on Foata normal form. 2/2124 useless extension candidates. Maximal degree in co-relation 8975. Up to 1043 conditions per place. [2025-03-15 00:58:40,226 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 28 selfloop transitions, 1 changer transitions 13/174 dead transitions. [2025-03-15 00:58:40,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 174 transitions, 1129 flow [2025-03-15 00:58:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:40,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:40,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2025-03-15 00:58:40,232 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9263351749539595 [2025-03-15 00:58:40,232 INFO L298 CegarLoopForPetriNet]: 185 programPoint places, -6 predicate places. [2025-03-15 00:58:40,232 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 174 transitions, 1129 flow [2025-03-15 00:58:40,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 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:58:40,233 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:40,233 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] [2025-03-15 00:58:40,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:58:40,233 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-03-15 00:58:40,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:40,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2109207734, now seen corresponding path program 1 times [2025-03-15 00:58:40,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:40,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719099579] [2025-03-15 00:58:40,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:40,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:40,291 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:58:40,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:40,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719099579] [2025-03-15 00:58:40,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719099579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:40,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:40,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:40,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940634859] [2025-03-15 00:58:40,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:40,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:40,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:40,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:40,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:40,293 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 181 [2025-03-15 00:58:40,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 174 transitions, 1129 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 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:58:40,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:40,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 181 [2025-03-15 00:58:40,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:40,476 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][137], [72#L54-12true, 26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 215#true, 218#true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 51#L48-13true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 221#true, 206#true, thread3Thread1of1ForFork2InUse, 202#(= |#race~sponsored_1~0| 0), 188#true, 212#true]) [2025-03-15 00:58:40,476 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2025-03-15 00:58:40,476 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-03-15 00:58:40,476 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-03-15 00:58:40,476 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:58:40,477 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][137], [72#L54-12true, 205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 215#true, 218#true, 94#L48-14true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 221#true, thread3Thread1of1ForFork2InUse, 206#true, 188#true, 202#(= |#race~sponsored_1~0| 0), 212#true]) [2025-03-15 00:58:40,478 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-03-15 00:58:40,478 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-15 00:58:40,478 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:58:40,478 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-15 00:58:40,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][138], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 215#true, 218#true, 214#(= |thread3Thread1of1ForFork2_#t~nondet6| |#race~result_5~0|), 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 51#L48-13true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 221#true, 206#true, thread3Thread1of1ForFork2InUse, 176#L54-13true, 188#true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:40,478 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-03-15 00:58:40,478 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-15 00:58:40,478 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:58:40,478 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-03-15 00:58:40,479 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][138], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 218#true, 215#true, 94#L48-14true, 214#(= |thread3Thread1of1ForFork2_#t~nondet6| |#race~result_5~0|), 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 221#true, 206#true, thread3Thread1of1ForFork2InUse, 176#L54-13true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:40,479 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-15 00:58:40,479 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-15 00:58:40,479 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:58:40,479 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:58:40,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][138], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 215#true, 218#true, 10#L54-14true, 214#(= |thread3Thread1of1ForFork2_#t~nondet6| |#race~result_5~0|), 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 51#L48-13true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 221#true, 206#true, thread3Thread1of1ForFork2InUse, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:40,480 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-15 00:58:40,480 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:58:40,480 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-15 00:58:40,480 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-15 00:58:40,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][134], [72#L54-12true, 205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 218#true, 215#true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 221#true, 206#true, thread3Thread1of1ForFork2InUse, 188#true, 92#L50true, 202#(= |#race~sponsored_1~0| 0), 212#true]) [2025-03-15 00:58:40,480 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-03-15 00:58:40,480 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:58:40,480 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-15 00:58:40,480 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:58:40,481 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][138], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 191#true, 215#true, 218#true, 94#L48-14true, 10#L54-14true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 214#(= |thread3Thread1of1ForFork2_#t~nondet6| |#race~result_5~0|), 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 221#true, 206#true, thread3Thread1of1ForFork2InUse, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:40,481 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-03-15 00:58:40,481 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:58:40,481 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-03-15 00:58:40,481 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-15 00:58:40,481 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 215#true, 218#true, 209#true, 214#(= |thread3Thread1of1ForFork2_#t~nondet6| |#race~result_5~0|), 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 221#true, 206#true, thread3Thread1of1ForFork2InUse, 176#L54-13true, 188#true, 92#L50true, 202#(= |#race~sponsored_1~0| 0)]) [2025-03-15 00:58:40,481 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2025-03-15 00:58:40,481 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-15 00:58:40,481 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-15 00:58:40,481 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-15 00:58:40,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][137], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 80#L56true, 191#true, 215#true, 218#true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 51#L48-13true, 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 221#true, thread3Thread1of1ForFork2InUse, 206#true, 188#true, 202#(= |#race~sponsored_1~0| 0), 212#true]) [2025-03-15 00:58:40,482 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2025-03-15 00:58:40,482 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-15 00:58:40,482 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-15 00:58:40,482 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-03-15 00:58:40,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][136], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 191#true, 215#true, 218#true, 209#true, 10#L54-14true, 214#(= |thread3Thread1of1ForFork2_#t~nondet6| |#race~result_5~0|), 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 221#true, 206#true, thread3Thread1of1ForFork2InUse, 92#L50true, 202#(= |#race~sponsored_1~0| 0), 188#true]) [2025-03-15 00:58:40,483 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-03-15 00:58:40,483 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-15 00:58:40,483 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-15 00:58:40,483 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-15 00:58:40,484 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][137], [205#(= |#race~sponsored_2~0| 0), 26#L71-1true, 80#L56true, 191#true, 215#true, 218#true, 94#L48-14true, 211#(= |thread2Thread1of1ForFork1_#t~nondet4| |#race~result_4~0|), 194#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 199#(= |#race~sponsored_0~0| 0), 221#true, 206#true, thread3Thread1of1ForFork2InUse, 188#true, 202#(= |#race~sponsored_1~0| 0), 212#true]) [2025-03-15 00:58:40,484 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-03-15 00:58:40,484 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-15 00:58:40,484 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-15 00:58:40,484 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-03-15 00:58:40,485 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] thread1EXIT-->L71-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[][134], [26#L71-1true, 205#(= |#race~sponsored_2~0| 0), 80#L56true, 191#true, 215#true, 218#true, 209#true, 194#true, thread2Thread1of1ForFork1InUse, 199#(= |#race~sponsored_0~0| 0), thread1Thread1of1ForFork0NotInUse, 221#true, 206#true, thread3Thread1of1ForFork2InUse, 92#L50true, 202#(= |#race~sponsored_1~0| 0), 188#true, 212#true]) [2025-03-15 00:58:40,485 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-03-15 00:58:40,485 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-03-15 00:58:40,485 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-15 00:58:40,485 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-03-15 00:58:40,495 INFO L124 PetriNetUnfolderBase]: 826/2755 cut-off events. [2025-03-15 00:58:40,496 INFO L125 PetriNetUnfolderBase]: For 49255/51730 co-relation queries the response was YES. [2025-03-15 00:58:40,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11028 conditions, 2755 events. 826/2755 cut-off events. For 49255/51730 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 25155 event pairs, 340 based on Foata normal form. 1/2390 useless extension candidates. Maximal degree in co-relation 10332. Up to 993 conditions per place. [2025-03-15 00:58:40,514 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 0 selfloop transitions, 0 changer transitions 172/172 dead transitions. [2025-03-15 00:58:40,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 172 transitions, 1179 flow [2025-03-15 00:58:40,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2025-03-15 00:58:40,516 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9263351749539595 [2025-03-15 00:58:40,518 INFO L298 CegarLoopForPetriNet]: 185 programPoint places, -6 predicate places. [2025-03-15 00:58:40,518 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 172 transitions, 1179 flow [2025-03-15 00:58:40,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 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:58:40,524 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/chl-sre-subst.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 00:58:40,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (34 of 35 remaining) [2025-03-15 00:58:40,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (33 of 35 remaining) [2025-03-15 00:58:40,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (32 of 35 remaining) [2025-03-15 00:58:40,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (31 of 35 remaining) [2025-03-15 00:58:40,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (30 of 35 remaining) [2025-03-15 00:58:40,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (29 of 35 remaining) [2025-03-15 00:58:40,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (28 of 35 remaining) [2025-03-15 00:58:40,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (27 of 35 remaining) [2025-03-15 00:58:40,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (26 of 35 remaining) [2025-03-15 00:58:40,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (25 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (24 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (23 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (20 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (18 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (15 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (11 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (10 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (9 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (8 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (7 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (6 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (5 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (4 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (3 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (2 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (1 of 35 remaining) [2025-03-15 00:58:40,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (0 of 35 remaining) [2025-03-15 00:58:40,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:58:40,551 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:58:40,556 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:58:40,556 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:58:40,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:58:40 BasicIcfg [2025-03-15 00:58:40,562 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:58:40,562 INFO L158 Benchmark]: Toolchain (without parser) took 4718.61ms. Allocated memory was 71.3MB in the beginning and 323.0MB in the end (delta: 251.7MB). Free memory was 44.3MB in the beginning and 66.7MB in the end (delta: -22.4MB). Peak memory consumption was 230.5MB. Max. memory is 8.0GB. [2025-03-15 00:58:40,563 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 71.3MB. Free memory is still 32.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:58:40,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.81ms. Allocated memory is still 71.3MB. Free memory was 44.1MB in the beginning and 32.5MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 00:58:40,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.39ms. Allocated memory is still 71.3MB. Free memory was 32.5MB in the beginning and 31.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:58:40,563 INFO L158 Benchmark]: Boogie Preprocessor took 28.59ms. Allocated memory is still 71.3MB. Free memory was 31.1MB in the beginning and 30.1MB in the end (delta: 987.7kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:58:40,563 INFO L158 Benchmark]: RCFGBuilder took 361.03ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 40.9MB in the end (delta: -10.9MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. [2025-03-15 00:58:40,563 INFO L158 Benchmark]: TraceAbstraction took 4101.27ms. Allocated memory was 71.3MB in the beginning and 323.0MB in the end (delta: 251.7MB). Free memory was 39.8MB in the beginning and 66.7MB in the end (delta: -26.9MB). Peak memory consumption was 223.6MB. Max. memory is 8.0GB. [2025-03-15 00:58:40,564 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.17ms. Allocated memory is still 71.3MB. Free memory is still 32.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 191.81ms. Allocated memory is still 71.3MB. Free memory was 44.1MB in the beginning and 32.5MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.39ms. Allocated memory is still 71.3MB. Free memory was 32.5MB in the beginning and 31.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 28.59ms. Allocated memory is still 71.3MB. Free memory was 31.1MB in the beginning and 30.1MB in the end (delta: 987.7kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 361.03ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 40.9MB in the end (delta: -10.9MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. * TraceAbstraction took 4101.27ms. Allocated memory was 71.3MB in the beginning and 323.0MB in the end (delta: 251.7MB). Free memory was 39.8MB in the beginning and 66.7MB in the end (delta: -26.9MB). Peak memory consumption was 223.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: 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: 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: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: 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: 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: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 248 locations, 35 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: 4.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 233 IncrementalHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 95 mSDtfsCounter, 233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1179occurred in iteration=12, InterpolantAutomatonStates: 36, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 778 NumberOfCodeBlocks, 778 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 766 ConstructedInterpolants, 0 QuantifiedInterpolants, 790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 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 20 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 00:58:40,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...