/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/parallel-parallel-sum-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:00:08,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:00:08,634 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 01:00:08,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:00:08,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:00:08,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:00:08,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:00:08,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:00:08,658 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:00:08,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:00:08,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:00:08,658 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:00:08,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:00:08,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:00:08,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:00:08,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:00:08,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:00:08,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:00:08,659 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:00:08,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:00:08,659 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:00:08,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:00:08,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:00:08,659 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:00:08,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:00:08,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:00:08,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:00:08,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:00:08,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:00:08,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:00:08,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:00:08,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:00:08,662 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 01:00:08,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:00:08,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:00:08,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:00:08,931 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:00:08,932 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:00:08,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2025-03-15 01:00:10,086 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79b76fab1/77bf201e0eb543279c5deaa9a40c5fab/FLAG7c3261039 [2025-03-15 01:00:10,282 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:00:10,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2025-03-15 01:00:10,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79b76fab1/77bf201e0eb543279c5deaa9a40c5fab/FLAG7c3261039 [2025-03-15 01:00:10,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79b76fab1/77bf201e0eb543279c5deaa9a40c5fab [2025-03-15 01:00:10,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:00:10,310 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:00:10,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:00:10,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:00:10,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:00:10,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:00:10" (1/1) ... [2025-03-15 01:00:10,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b40d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:10, skipping insertion in model container [2025-03-15 01:00:10,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:00:10" (1/1) ... [2025-03-15 01:00:10,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:00:10,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:00:10,494 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:00:10,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:00:10,546 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:00:10,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:10 WrapperNode [2025-03-15 01:00:10,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:00:10,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:00:10,547 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:00:10,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:00:10,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:10" (1/1) ... [2025-03-15 01:00:10,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:10" (1/1) ... [2025-03-15 01:00:10,592 INFO L138 Inliner]: procedures = 26, calls = 54, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 411 [2025-03-15 01:00:10,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:00:10,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:00:10,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:00:10,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:00:10,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:10" (1/1) ... [2025-03-15 01:00:10,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:10" (1/1) ... [2025-03-15 01:00:10,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:10" (1/1) ... [2025-03-15 01:00:10,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:10" (1/1) ... [2025-03-15 01:00:10,629 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:10" (1/1) ... [2025-03-15 01:00:10,633 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:10" (1/1) ... [2025-03-15 01:00:10,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:10" (1/1) ... [2025-03-15 01:00:10,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:10" (1/1) ... [2025-03-15 01:00:10,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:10" (1/1) ... [2025-03-15 01:00:10,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:00:10,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:00:10,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:00:10,654 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:00:10,659 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:10" (1/1) ... [2025-03-15 01:00:10,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:00:10,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:00:10,692 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 01:00:10,696 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 01:00:10,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:00:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:00:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:00:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 01:00:10,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 01:00:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 01:00:10,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 01:00:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 01:00:10,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 01:00:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-15 01:00:10,717 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-15 01:00:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:00:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 01:00:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 01:00:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 01:00:10,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:00:10,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:00:10,718 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 01:00:10,815 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:00:10,817 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:00:11,307 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:00:11,307 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:00:11,560 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:00:11,561 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-03-15 01:00:11,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:00:11 BoogieIcfgContainer [2025-03-15 01:00:11,561 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:00:11,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:00:11,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:00:11,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:00:11,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:00:10" (1/3) ... [2025-03-15 01:00:11,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4500952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:00:11, skipping insertion in model container [2025-03-15 01:00:11,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:10" (2/3) ... [2025-03-15 01:00:11,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4500952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:00:11, skipping insertion in model container [2025-03-15 01:00:11,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:00:11" (3/3) ... [2025-03-15 01:00:11,571 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2025-03-15 01:00:11,583 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:00:11,585 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-equiv.wvr.c that has 5 procedures, 291 locations, 1 initial locations, 4 loop locations, and 57 error locations. [2025-03-15 01:00:11,585 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:00:11,679 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2025-03-15 01:00:11,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:00:11,728 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;@5b0e8f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:00:11,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 106 error locations. [2025-03-15 01:00:11,749 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:00:11,749 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-15 01:00:11,752 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:00:11,753 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:11,753 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] [2025-03-15 01:00:11,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-15 01:00:11,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:11,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1058714959, now seen corresponding path program 1 times [2025-03-15 01:00:11,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:11,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311835569] [2025-03-15 01:00:11,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:11,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:11,899 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 01:00:11,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:11,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311835569] [2025-03-15 01:00:11,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311835569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:11,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:11,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:11,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934278356] [2025-03-15 01:00:11,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:11,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:11,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:11,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:11,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:11,930 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 309 [2025-03-15 01:00:11,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 307 transitions, 654 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 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 01:00:11,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:11,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 309 [2025-03-15 01:00:11,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:12,263 INFO L124 PetriNetUnfolderBase]: 301/1010 cut-off events. [2025-03-15 01:00:12,264 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2025-03-15 01:00:12,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1604 conditions, 1010 events. 301/1010 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5060 event pairs, 159 based on Foata normal form. 116/1019 useless extension candidates. Maximal degree in co-relation 1389. Up to 440 conditions per place. [2025-03-15 01:00:12,279 INFO L140 encePairwiseOnDemand]: 255/309 looper letters, 30 selfloop transitions, 2 changer transitions 12/241 dead transitions. [2025-03-15 01:00:12,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 241 transitions, 576 flow [2025-03-15 01:00:12,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:12,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 744 transitions. [2025-03-15 01:00:12,295 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8025889967637541 [2025-03-15 01:00:12,298 INFO L298 CegarLoopForPetriNet]: 307 programPoint places, -57 predicate places. [2025-03-15 01:00:12,299 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 241 transitions, 576 flow [2025-03-15 01:00:12,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 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 01:00:12,299 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:12,299 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] [2025-03-15 01:00:12,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:00:12,300 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-15 01:00:12,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:12,300 INFO L85 PathProgramCache]: Analyzing trace with hash 687466263, now seen corresponding path program 1 times [2025-03-15 01:00:12,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:12,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748072096] [2025-03-15 01:00:12,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:12,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:12,346 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 01:00:12,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:12,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748072096] [2025-03-15 01:00:12,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748072096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:12,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:12,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:12,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319557396] [2025-03-15 01:00:12,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:12,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:12,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:12,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:12,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:12,349 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 309 [2025-03-15 01:00:12,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 241 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:12,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:12,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 309 [2025-03-15 01:00:12,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:12,554 INFO L124 PetriNetUnfolderBase]: 301/1009 cut-off events. [2025-03-15 01:00:12,554 INFO L125 PetriNetUnfolderBase]: For 329/365 co-relation queries the response was YES. [2025-03-15 01:00:12,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2042 conditions, 1009 events. 301/1009 cut-off events. For 329/365 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5039 event pairs, 159 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 1809. Up to 440 conditions per place. [2025-03-15 01:00:12,563 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 27 selfloop transitions, 2 changer transitions 12/240 dead transitions. [2025-03-15 01:00:12,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 240 transitions, 632 flow [2025-03-15 01:00:12,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:12,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions. [2025-03-15 01:00:12,566 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7540453074433657 [2025-03-15 01:00:12,567 INFO L298 CegarLoopForPetriNet]: 307 programPoint places, -56 predicate places. [2025-03-15 01:00:12,567 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 240 transitions, 632 flow [2025-03-15 01:00:12,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:12,568 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:12,568 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] [2025-03-15 01:00:12,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:00:12,568 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-15 01:00:12,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:12,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1465808812, now seen corresponding path program 1 times [2025-03-15 01:00:12,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:12,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481604889] [2025-03-15 01:00:12,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:12,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:12,619 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 01:00:12,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:12,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481604889] [2025-03-15 01:00:12,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481604889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:12,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:12,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:12,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168224337] [2025-03-15 01:00:12,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:12,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:12,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:12,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:12,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:12,634 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 309 [2025-03-15 01:00:12,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 240 transitions, 632 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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 01:00:12,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:12,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 309 [2025-03-15 01:00:12,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:12,809 INFO L124 PetriNetUnfolderBase]: 301/1008 cut-off events. [2025-03-15 01:00:12,809 INFO L125 PetriNetUnfolderBase]: For 678/750 co-relation queries the response was YES. [2025-03-15 01:00:12,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2477 conditions, 1008 events. 301/1008 cut-off events. For 678/750 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5058 event pairs, 159 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 2229. Up to 440 conditions per place. [2025-03-15 01:00:12,817 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 24 selfloop transitions, 2 changer transitions 12/239 dead transitions. [2025-03-15 01:00:12,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 239 transitions, 682 flow [2025-03-15 01:00:12,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2025-03-15 01:00:12,822 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7605177993527508 [2025-03-15 01:00:12,823 INFO L298 CegarLoopForPetriNet]: 307 programPoint places, -55 predicate places. [2025-03-15 01:00:12,823 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 239 transitions, 682 flow [2025-03-15 01:00:12,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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 01:00:12,823 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:12,823 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] [2025-03-15 01:00:12,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:00:12,823 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-15 01:00:12,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:12,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1270777376, now seen corresponding path program 1 times [2025-03-15 01:00:12,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:12,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142975263] [2025-03-15 01:00:12,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:12,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:12,867 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 01:00:12,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:12,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142975263] [2025-03-15 01:00:12,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142975263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:12,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:12,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:12,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402340109] [2025-03-15 01:00:12,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:12,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:12,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:12,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:12,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:12,869 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 309 [2025-03-15 01:00:12,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 239 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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 01:00:12,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:12,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 309 [2025-03-15 01:00:12,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:13,010 INFO L124 PetriNetUnfolderBase]: 301/1007 cut-off events. [2025-03-15 01:00:13,010 INFO L125 PetriNetUnfolderBase]: For 1171/1279 co-relation queries the response was YES. [2025-03-15 01:00:13,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2912 conditions, 1007 events. 301/1007 cut-off events. For 1171/1279 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5062 event pairs, 159 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 2649. Up to 440 conditions per place. [2025-03-15 01:00:13,019 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 24 selfloop transitions, 2 changer transitions 12/238 dead transitions. [2025-03-15 01:00:13,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 238 transitions, 732 flow [2025-03-15 01:00:13,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2025-03-15 01:00:13,021 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7605177993527508 [2025-03-15 01:00:13,023 INFO L298 CegarLoopForPetriNet]: 307 programPoint places, -54 predicate places. [2025-03-15 01:00:13,023 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 238 transitions, 732 flow [2025-03-15 01:00:13,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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 01:00:13,023 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:13,023 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] [2025-03-15 01:00:13,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:00:13,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-15 01:00:13,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:13,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1042129781, now seen corresponding path program 1 times [2025-03-15 01:00:13,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:13,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196982152] [2025-03-15 01:00:13,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:13,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:13,076 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 01:00:13,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:13,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196982152] [2025-03-15 01:00:13,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196982152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:13,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:13,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:13,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669143308] [2025-03-15 01:00:13,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:13,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:13,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:13,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:13,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:13,078 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 309 [2025-03-15 01:00:13,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 238 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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 01:00:13,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:13,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 309 [2025-03-15 01:00:13,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:13,220 INFO L124 PetriNetUnfolderBase]: 301/1006 cut-off events. [2025-03-15 01:00:13,220 INFO L125 PetriNetUnfolderBase]: For 1808/1952 co-relation queries the response was YES. [2025-03-15 01:00:13,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3347 conditions, 1006 events. 301/1006 cut-off events. For 1808/1952 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5043 event pairs, 159 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 3069. Up to 440 conditions per place. [2025-03-15 01:00:13,229 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 24 selfloop transitions, 2 changer transitions 12/237 dead transitions. [2025-03-15 01:00:13,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 237 transitions, 782 flow [2025-03-15 01:00:13,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:13,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2025-03-15 01:00:13,230 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7605177993527508 [2025-03-15 01:00:13,232 INFO L298 CegarLoopForPetriNet]: 307 programPoint places, -53 predicate places. [2025-03-15 01:00:13,232 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 237 transitions, 782 flow [2025-03-15 01:00:13,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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 01:00:13,232 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:13,232 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] [2025-03-15 01:00:13,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:00:13,232 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-15 01:00:13,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:13,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1500336764, now seen corresponding path program 1 times [2025-03-15 01:00:13,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:13,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579918757] [2025-03-15 01:00:13,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:13,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:13,300 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 01:00:13,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:13,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579918757] [2025-03-15 01:00:13,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579918757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:13,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:13,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:13,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156723001] [2025-03-15 01:00:13,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:13,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:13,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:13,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:13,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:13,303 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 309 [2025-03-15 01:00:13,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 237 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:13,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:13,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 309 [2025-03-15 01:00:13,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:13,451 INFO L124 PetriNetUnfolderBase]: 301/1005 cut-off events. [2025-03-15 01:00:13,451 INFO L125 PetriNetUnfolderBase]: For 2589/2769 co-relation queries the response was YES. [2025-03-15 01:00:13,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3785 conditions, 1005 events. 301/1005 cut-off events. For 2589/2769 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5009 event pairs, 159 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 3489. Up to 440 conditions per place. [2025-03-15 01:00:13,460 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 26 selfloop transitions, 2 changer transitions 12/236 dead transitions. [2025-03-15 01:00:13,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 236 transitions, 838 flow [2025-03-15 01:00:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:13,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:13,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions. [2025-03-15 01:00:13,462 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7540453074433657 [2025-03-15 01:00:13,462 INFO L298 CegarLoopForPetriNet]: 307 programPoint places, -52 predicate places. [2025-03-15 01:00:13,462 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 236 transitions, 838 flow [2025-03-15 01:00:13,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:13,463 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:13,463 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] [2025-03-15 01:00:13,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:00:13,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-15 01:00:13,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:13,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1911918701, now seen corresponding path program 1 times [2025-03-15 01:00:13,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:13,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871265012] [2025-03-15 01:00:13,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:13,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:13,504 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 01:00:13,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:13,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871265012] [2025-03-15 01:00:13,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871265012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:13,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:13,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:13,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401500700] [2025-03-15 01:00:13,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:13,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:13,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:13,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:13,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:13,507 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 309 [2025-03-15 01:00:13,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 236 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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 01:00:13,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:13,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 309 [2025-03-15 01:00:13,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:13,641 INFO L124 PetriNetUnfolderBase]: 301/1004 cut-off events. [2025-03-15 01:00:13,642 INFO L125 PetriNetUnfolderBase]: For 3514/3730 co-relation queries the response was YES. [2025-03-15 01:00:13,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4220 conditions, 1004 events. 301/1004 cut-off events. For 3514/3730 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5016 event pairs, 159 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 3909. Up to 440 conditions per place. [2025-03-15 01:00:13,650 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 24 selfloop transitions, 2 changer transitions 12/235 dead transitions. [2025-03-15 01:00:13,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 235 transitions, 888 flow [2025-03-15 01:00:13,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2025-03-15 01:00:13,652 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7605177993527508 [2025-03-15 01:00:13,652 INFO L298 CegarLoopForPetriNet]: 307 programPoint places, -51 predicate places. [2025-03-15 01:00:13,652 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 235 transitions, 888 flow [2025-03-15 01:00:13,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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 01:00:13,653 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:13,653 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] [2025-03-15 01:00:13,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:00:13,653 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-15 01:00:13,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:13,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1655296158, now seen corresponding path program 1 times [2025-03-15 01:00:13,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:13,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177138352] [2025-03-15 01:00:13,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:13,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:13,702 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 01:00:13,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:13,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177138352] [2025-03-15 01:00:13,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177138352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:13,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:13,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:13,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829544126] [2025-03-15 01:00:13,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:13,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:13,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:13,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:13,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:13,704 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 309 [2025-03-15 01:00:13,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 235 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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 01:00:13,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:13,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 309 [2025-03-15 01:00:13,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:13,849 INFO L124 PetriNetUnfolderBase]: 301/1003 cut-off events. [2025-03-15 01:00:13,849 INFO L125 PetriNetUnfolderBase]: For 4583/4835 co-relation queries the response was YES. [2025-03-15 01:00:13,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4655 conditions, 1003 events. 301/1003 cut-off events. For 4583/4835 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5046 event pairs, 159 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 4329. Up to 440 conditions per place. [2025-03-15 01:00:13,860 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 24 selfloop transitions, 2 changer transitions 12/234 dead transitions. [2025-03-15 01:00:13,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 234 transitions, 938 flow [2025-03-15 01:00:13,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:13,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:13,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2025-03-15 01:00:13,862 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7605177993527508 [2025-03-15 01:00:13,862 INFO L298 CegarLoopForPetriNet]: 307 programPoint places, -50 predicate places. [2025-03-15 01:00:13,862 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 234 transitions, 938 flow [2025-03-15 01:00:13,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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 01:00:13,863 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:13,863 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] [2025-03-15 01:00:13,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:00:13,863 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-15 01:00:13,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:13,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1602333723, now seen corresponding path program 1 times [2025-03-15 01:00:13,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:13,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57695365] [2025-03-15 01:00:13,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:13,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:13,915 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 01:00:13,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:13,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57695365] [2025-03-15 01:00:13,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57695365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:13,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:13,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:13,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841986781] [2025-03-15 01:00:13,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:13,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:13,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:13,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:13,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:13,917 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 309 [2025-03-15 01:00:13,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 234 transitions, 938 flow. Second operand has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 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 01:00:13,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:13,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 309 [2025-03-15 01:00:13,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:14,044 INFO L124 PetriNetUnfolderBase]: 301/1001 cut-off events. [2025-03-15 01:00:14,044 INFO L125 PetriNetUnfolderBase]: For 5790/6078 co-relation queries the response was YES. [2025-03-15 01:00:14,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5088 conditions, 1001 events. 301/1001 cut-off events. For 5790/6078 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5083 event pairs, 159 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 4749. Up to 438 conditions per place. [2025-03-15 01:00:14,052 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 26 selfloop transitions, 1 changer transitions 12/232 dead transitions. [2025-03-15 01:00:14,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 232 transitions, 984 flow [2025-03-15 01:00:14,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:14,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2025-03-15 01:00:14,054 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.756202804746494 [2025-03-15 01:00:14,054 INFO L298 CegarLoopForPetriNet]: 307 programPoint places, -50 predicate places. [2025-03-15 01:00:14,054 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 232 transitions, 984 flow [2025-03-15 01:00:14,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 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 01:00:14,055 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:14,055 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:14,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:00:14,055 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-15 01:00:14,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:14,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2026583973, now seen corresponding path program 1 times [2025-03-15 01:00:14,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:14,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309744392] [2025-03-15 01:00:14,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:14,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:14,098 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 01:00:14,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:14,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309744392] [2025-03-15 01:00:14,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309744392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:14,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:14,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:14,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435794614] [2025-03-15 01:00:14,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:14,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:14,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:14,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:14,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:14,099 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 309 [2025-03-15 01:00:14,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 232 transitions, 984 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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 01:00:14,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:14,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 309 [2025-03-15 01:00:14,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:14,245 INFO L124 PetriNetUnfolderBase]: 301/1000 cut-off events. [2025-03-15 01:00:14,245 INFO L125 PetriNetUnfolderBase]: For 7146/7470 co-relation queries the response was YES. [2025-03-15 01:00:14,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5523 conditions, 1000 events. 301/1000 cut-off events. For 7146/7470 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5046 event pairs, 159 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 5169. Up to 438 conditions per place. [2025-03-15 01:00:14,255 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 24 selfloop transitions, 2 changer transitions 12/231 dead transitions. [2025-03-15 01:00:14,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 231 transitions, 1034 flow [2025-03-15 01:00:14,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:14,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:14,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2025-03-15 01:00:14,257 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7605177993527508 [2025-03-15 01:00:14,257 INFO L298 CegarLoopForPetriNet]: 307 programPoint places, -49 predicate places. [2025-03-15 01:00:14,257 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 231 transitions, 1034 flow [2025-03-15 01:00:14,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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 01:00:14,258 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:14,258 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:14,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:00:14,258 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-15 01:00:14,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:14,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1314096446, now seen corresponding path program 1 times [2025-03-15 01:00:14,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:14,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625002943] [2025-03-15 01:00:14,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:14,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:14,792 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 01:00:14,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:14,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625002943] [2025-03-15 01:00:14,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625002943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:14,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:14,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:00:14,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046737249] [2025-03-15 01:00:14,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:14,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:00:14,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:14,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:00:14,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:00:14,794 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 309 [2025-03-15 01:00:14,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 231 transitions, 1034 flow. Second operand has 6 states, 6 states have (on average 215.83333333333334) internal successors, (1295), 6 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:14,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:14,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 309 [2025-03-15 01:00:14,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:15,011 INFO L124 PetriNetUnfolderBase]: 301/999 cut-off events. [2025-03-15 01:00:15,012 INFO L125 PetriNetUnfolderBase]: For 8637/8997 co-relation queries the response was YES. [2025-03-15 01:00:15,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5971 conditions, 999 events. 301/999 cut-off events. For 8637/8997 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5056 event pairs, 159 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 5589. Up to 444 conditions per place. [2025-03-15 01:00:15,022 INFO L140 encePairwiseOnDemand]: 303/309 looper letters, 34 selfloop transitions, 5 changer transitions 12/230 dead transitions. [2025-03-15 01:00:15,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 230 transitions, 1110 flow [2025-03-15 01:00:15,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:00:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:00:15,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1324 transitions. [2025-03-15 01:00:15,026 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7141316073354909 [2025-03-15 01:00:15,027 INFO L298 CegarLoopForPetriNet]: 307 programPoint places, -45 predicate places. [2025-03-15 01:00:15,027 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 230 transitions, 1110 flow [2025-03-15 01:00:15,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 215.83333333333334) internal successors, (1295), 6 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:15,028 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:15,028 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:15,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:00:15,029 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-15 01:00:15,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:15,029 INFO L85 PathProgramCache]: Analyzing trace with hash 584354383, now seen corresponding path program 1 times [2025-03-15 01:00:15,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:15,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191430021] [2025-03-15 01:00:15,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:15,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:15,085 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 01:00:15,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:15,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191430021] [2025-03-15 01:00:15,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191430021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:15,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:15,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:15,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823097932] [2025-03-15 01:00:15,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:15,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:15,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:15,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:15,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:15,087 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 309 [2025-03-15 01:00:15,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 230 transitions, 1110 flow. Second operand has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 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 01:00:15,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:15,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 309 [2025-03-15 01:00:15,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:15,214 INFO L124 PetriNetUnfolderBase]: 301/998 cut-off events. [2025-03-15 01:00:15,214 INFO L125 PetriNetUnfolderBase]: For 10271/10667 co-relation queries the response was YES. [2025-03-15 01:00:15,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6404 conditions, 998 events. 301/998 cut-off events. For 10271/10667 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5016 event pairs, 159 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 6009. Up to 444 conditions per place. [2025-03-15 01:00:15,224 INFO L140 encePairwiseOnDemand]: 307/309 looper letters, 24 selfloop transitions, 1 changer transitions 12/229 dead transitions. [2025-03-15 01:00:15,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 229 transitions, 1156 flow [2025-03-15 01:00:15,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:15,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:15,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions. [2025-03-15 01:00:15,226 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7626752966558792 [2025-03-15 01:00:15,227 INFO L298 CegarLoopForPetriNet]: 307 programPoint places, -44 predicate places. [2025-03-15 01:00:15,227 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 229 transitions, 1156 flow [2025-03-15 01:00:15,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 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 01:00:15,228 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:15,228 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:15,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:00:15,228 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-15 01:00:15,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:15,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1032698421, now seen corresponding path program 1 times [2025-03-15 01:00:15,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:15,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898035884] [2025-03-15 01:00:15,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:15,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:15,286 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 01:00:15,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:15,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898035884] [2025-03-15 01:00:15,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898035884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:15,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:15,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:15,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882772936] [2025-03-15 01:00:15,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:15,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:15,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:15,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:15,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:15,287 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 309 [2025-03-15 01:00:15,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 229 transitions, 1156 flow. Second operand has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 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 01:00:15,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:15,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 309 [2025-03-15 01:00:15,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:15,414 INFO L124 PetriNetUnfolderBase]: 301/997 cut-off events. [2025-03-15 01:00:15,415 INFO L125 PetriNetUnfolderBase]: For 12049/12481 co-relation queries the response was YES. [2025-03-15 01:00:15,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6837 conditions, 997 events. 301/997 cut-off events. For 12049/12481 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5023 event pairs, 159 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 6429. Up to 444 conditions per place. [2025-03-15 01:00:15,424 INFO L140 encePairwiseOnDemand]: 307/309 looper letters, 0 selfloop transitions, 0 changer transitions 228/228 dead transitions. [2025-03-15 01:00:15,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 228 transitions, 1202 flow [2025-03-15 01:00:15,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:15,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions. [2025-03-15 01:00:15,428 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7626752966558792 [2025-03-15 01:00:15,428 INFO L298 CegarLoopForPetriNet]: 307 programPoint places, -43 predicate places. [2025-03-15 01:00:15,428 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 228 transitions, 1202 flow [2025-03-15 01:00:15,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 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 01:00:15,440 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-parallel-sum-equiv.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 01:00:15,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (105 of 106 remaining) [2025-03-15 01:00:15,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (104 of 106 remaining) [2025-03-15 01:00:15,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (103 of 106 remaining) [2025-03-15 01:00:15,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (102 of 106 remaining) [2025-03-15 01:00:15,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (101 of 106 remaining) [2025-03-15 01:00:15,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (100 of 106 remaining) [2025-03-15 01:00:15,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (99 of 106 remaining) [2025-03-15 01:00:15,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (98 of 106 remaining) [2025-03-15 01:00:15,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (97 of 106 remaining) [2025-03-15 01:00:15,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (96 of 106 remaining) [2025-03-15 01:00:15,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (95 of 106 remaining) [2025-03-15 01:00:15,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (94 of 106 remaining) [2025-03-15 01:00:15,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (93 of 106 remaining) [2025-03-15 01:00:15,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (92 of 106 remaining) [2025-03-15 01:00:15,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (91 of 106 remaining) [2025-03-15 01:00:15,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (90 of 106 remaining) [2025-03-15 01:00:15,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (89 of 106 remaining) [2025-03-15 01:00:15,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (88 of 106 remaining) [2025-03-15 01:00:15,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (87 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (86 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (85 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (84 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (83 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (82 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (81 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (80 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (79 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (78 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (77 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (76 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (75 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (74 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (73 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (72 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (71 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (70 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (69 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (68 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (67 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (66 of 106 remaining) [2025-03-15 01:00:15,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (65 of 106 remaining) [2025-03-15 01:00:15,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (64 of 106 remaining) [2025-03-15 01:00:15,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (63 of 106 remaining) [2025-03-15 01:00:15,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (62 of 106 remaining) [2025-03-15 01:00:15,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (61 of 106 remaining) [2025-03-15 01:00:15,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (60 of 106 remaining) [2025-03-15 01:00:15,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (59 of 106 remaining) [2025-03-15 01:00:15,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (58 of 106 remaining) [2025-03-15 01:00:15,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (57 of 106 remaining) [2025-03-15 01:00:15,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (56 of 106 remaining) [2025-03-15 01:00:15,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (55 of 106 remaining) [2025-03-15 01:00:15,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (54 of 106 remaining) [2025-03-15 01:00:15,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (53 of 106 remaining) [2025-03-15 01:00:15,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (52 of 106 remaining) [2025-03-15 01:00:15,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (51 of 106 remaining) [2025-03-15 01:00:15,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (50 of 106 remaining) [2025-03-15 01:00:15,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (49 of 106 remaining) [2025-03-15 01:00:15,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (48 of 106 remaining) [2025-03-15 01:00:15,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (47 of 106 remaining) [2025-03-15 01:00:15,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (46 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (45 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (44 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (43 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork3Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork3Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (40 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (39 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (38 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (37 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (36 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (35 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (34 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (33 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (32 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (31 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (30 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (29 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (28 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (27 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (26 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (25 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (24 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (23 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (22 of 106 remaining) [2025-03-15 01:00:15,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (21 of 106 remaining) [2025-03-15 01:00:15,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (20 of 106 remaining) [2025-03-15 01:00:15,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (19 of 106 remaining) [2025-03-15 01:00:15,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (18 of 106 remaining) [2025-03-15 01:00:15,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (17 of 106 remaining) [2025-03-15 01:00:15,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (16 of 106 remaining) [2025-03-15 01:00:15,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (15 of 106 remaining) [2025-03-15 01:00:15,473 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (14 of 106 remaining) [2025-03-15 01:00:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (13 of 106 remaining) [2025-03-15 01:00:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (12 of 106 remaining) [2025-03-15 01:00:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (11 of 106 remaining) [2025-03-15 01:00:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (10 of 106 remaining) [2025-03-15 01:00:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (9 of 106 remaining) [2025-03-15 01:00:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (8 of 106 remaining) [2025-03-15 01:00:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (7 of 106 remaining) [2025-03-15 01:00:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (6 of 106 remaining) [2025-03-15 01:00:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (5 of 106 remaining) [2025-03-15 01:00:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (4 of 106 remaining) [2025-03-15 01:00:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (3 of 106 remaining) [2025-03-15 01:00:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (2 of 106 remaining) [2025-03-15 01:00:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (1 of 106 remaining) [2025-03-15 01:00:15,474 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (0 of 106 remaining) [2025-03-15 01:00:15,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:00:15,476 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:15,481 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:00:15,481 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:00:15,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:00:15 BasicIcfg [2025-03-15 01:00:15,487 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:00:15,488 INFO L158 Benchmark]: Toolchain (without parser) took 5178.04ms. Allocated memory was 71.3MB in the beginning and 230.7MB in the end (delta: 159.4MB). Free memory was 45.3MB in the beginning and 81.2MB in the end (delta: -35.9MB). Peak memory consumption was 122.8MB. Max. memory is 8.0GB. [2025-03-15 01:00:15,488 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 71.3MB. Free memory is still 33.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:00:15,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.12ms. Allocated memory is still 71.3MB. Free memory was 45.1MB in the beginning and 31.8MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 01:00:15,488 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.88ms. Allocated memory is still 71.3MB. Free memory was 31.6MB in the beginning and 29.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:00:15,488 INFO L158 Benchmark]: Boogie Preprocessor took 60.14ms. Allocated memory is still 71.3MB. Free memory was 28.8MB in the beginning and 26.6MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:00:15,489 INFO L158 Benchmark]: RCFGBuilder took 907.55ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 26.6MB in the beginning and 29.0MB in the end (delta: -2.5MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. [2025-03-15 01:00:15,489 INFO L158 Benchmark]: TraceAbstraction took 3924.44ms. Allocated memory was 88.1MB in the beginning and 230.7MB in the end (delta: 142.6MB). Free memory was 27.8MB in the beginning and 81.2MB in the end (delta: -53.3MB). Peak memory consumption was 88.3MB. Max. memory is 8.0GB. [2025-03-15 01:00:15,489 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 33.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.12ms. Allocated memory is still 71.3MB. Free memory was 45.1MB in the beginning and 31.8MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.88ms. Allocated memory is still 71.3MB. Free memory was 31.6MB in the beginning and 29.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 60.14ms. Allocated memory is still 71.3MB. Free memory was 28.8MB in the beginning and 26.6MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 907.55ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 26.6MB in the beginning and 29.0MB in the end (delta: -2.5MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. * TraceAbstraction took 3924.44ms. Allocated memory was 88.1MB in the beginning and 230.7MB in the end (delta: 142.6MB). Free memory was 27.8MB in the beginning and 81.2MB in the end (delta: -53.3MB). Peak memory consumption was 88.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: 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 9 procedures, 398 locations, 106 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: 3.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 672 IncrementalHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 72 mSDtfsCounter, 672 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1202occurred in iteration=13, InterpolantAutomatonStates: 42, 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, 1.0s InterpolantComputationTime, 1129 NumberOfCodeBlocks, 1129 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1116 ConstructedInterpolants, 0 QuantifiedInterpolants, 1255 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 57 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:00:15,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...