/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/popl20-bad-buffer-mult-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:01:11,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:01:11,499 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:01:11,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:01:11,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:01:11,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:01:11,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:01:11,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:01:11,546 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:01:11,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:01:11,546 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:01:11,546 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:01:11,546 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:01:11,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:01:11,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:01:11,546 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:01:11,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:01:11,546 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:01:11,546 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:01:11,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:01:11,546 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:01:11,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:01:11,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:01:11,547 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:01:11,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:01:11,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:01:11,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:01:11,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:01:11,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:01:11,547 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:01:11,547 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:01:11,547 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:01:11,547 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:01:11,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:01:11,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:01:11,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:01:11,826 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:01:11,827 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:01:11,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2025-03-15 01:01:13,002 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddf1dd0b6/c1752157249246c0a068b41bfd36250c/FLAGbe23ead2b [2025-03-15 01:01:13,186 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:01:13,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2025-03-15 01:01:13,195 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddf1dd0b6/c1752157249246c0a068b41bfd36250c/FLAGbe23ead2b [2025-03-15 01:01:13,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddf1dd0b6/c1752157249246c0a068b41bfd36250c [2025-03-15 01:01:13,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:01:13,216 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:01:13,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:01:13,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:01:13,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:01:13,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:01:13" (1/1) ... [2025-03-15 01:01:13,222 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cff42f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:13, skipping insertion in model container [2025-03-15 01:01:13,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:01:13" (1/1) ... [2025-03-15 01:01:13,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:01:13,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:01:13,409 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:01:13,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:01:13,473 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:01:13,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:13 WrapperNode [2025-03-15 01:01:13,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:01:13,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:01:13,474 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:01:13,474 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:01:13,479 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:01:13" (1/1) ... [2025-03-15 01:01:13,491 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:01:13" (1/1) ... [2025-03-15 01:01:13,526 INFO L138 Inliner]: procedures = 25, calls = 56, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 597 [2025-03-15 01:01:13,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:01:13,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:01:13,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:01:13,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:01:13,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:13" (1/1) ... [2025-03-15 01:01:13,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:13" (1/1) ... [2025-03-15 01:01:13,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:13" (1/1) ... [2025-03-15 01:01:13,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:13" (1/1) ... [2025-03-15 01:01:13,553 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:13" (1/1) ... [2025-03-15 01:01:13,557 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:13" (1/1) ... [2025-03-15 01:01:13,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:13" (1/1) ... [2025-03-15 01:01:13,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:13" (1/1) ... [2025-03-15 01:01:13,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:13" (1/1) ... [2025-03-15 01:01:13,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:01:13,573 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:01:13,573 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:01:13,574 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:01:13,574 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:13" (1/1) ... [2025-03-15 01:01:13,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:01:13,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:01:13,608 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:01:13,612 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:01:13,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:01:13,632 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 01:01:13,632 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 01:01:13,632 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 01:01:13,633 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 01:01:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 01:01:13,633 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 01:01:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-15 01:01:13,633 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-15 01:01:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:01:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:01:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 01:01:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 01:01:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 01:01:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:01:13,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:01:13,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:01:13,635 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:01:13,774 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:01:13,776 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:01:14,470 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:01:14,470 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:01:14,921 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:01:14,921 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:01:14,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:01:14 BoogieIcfgContainer [2025-03-15 01:01:14,924 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:01:14,926 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:01:14,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:01:14,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:01:14,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:01:13" (1/3) ... [2025-03-15 01:01:14,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b66f866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:01:14, skipping insertion in model container [2025-03-15 01:01:14,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:13" (2/3) ... [2025-03-15 01:01:14,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b66f866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:01:14, skipping insertion in model container [2025-03-15 01:01:14,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:01:14" (3/3) ... [2025-03-15 01:01:14,933 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2025-03-15 01:01:14,949 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:01:14,953 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt2.wvr.c that has 5 procedures, 419 locations, 1 initial locations, 6 loop locations, and 95 error locations. [2025-03-15 01:01:14,953 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:01:15,072 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-15 01:01:15,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:01:15,117 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;@4a26e91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:01:15,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 169 error locations. [2025-03-15 01:01:15,144 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:01:15,144 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-15 01:01:15,147 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:01:15,147 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:15,147 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] [2025-03-15 01:01:15,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:15,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:15,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1075057498, now seen corresponding path program 1 times [2025-03-15 01:01:15,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:15,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933255869] [2025-03-15 01:01:15,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:15,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:15,309 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:01:15,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:15,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933255869] [2025-03-15 01:01:15,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933255869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:15,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:15,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:15,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817233525] [2025-03-15 01:01:15,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:15,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:15,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:15,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:15,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:15,343 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 435 [2025-03-15 01:01:15,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 435 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 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:01:15,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:15,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 435 [2025-03-15 01:01:15,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:15,790 INFO L124 PetriNetUnfolderBase]: 454/1210 cut-off events. [2025-03-15 01:01:15,790 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2025-03-15 01:01:15,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1955 conditions, 1210 events. 454/1210 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5204 event pairs, 272 based on Foata normal form. 8/1083 useless extension candidates. Maximal degree in co-relation 1525. Up to 618 conditions per place. [2025-03-15 01:01:15,811 INFO L140 encePairwiseOnDemand]: 354/435 looper letters, 29 selfloop transitions, 2 changer transitions 15/346 dead transitions. [2025-03-15 01:01:15,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 346 transitions, 778 flow [2025-03-15 01:01:15,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:15,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:15,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1082 transitions. [2025-03-15 01:01:15,829 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8291187739463601 [2025-03-15 01:01:15,831 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -80 predicate places. [2025-03-15 01:01:15,832 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 346 transitions, 778 flow [2025-03-15 01:01:15,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 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:01:15,832 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:15,832 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] [2025-03-15 01:01:15,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:01:15,833 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:15,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:15,834 INFO L85 PathProgramCache]: Analyzing trace with hash -938210966, now seen corresponding path program 1 times [2025-03-15 01:01:15,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:15,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145073584] [2025-03-15 01:01:15,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:15,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:15,890 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:01:15,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:15,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145073584] [2025-03-15 01:01:15,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145073584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:15,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:15,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:15,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114519947] [2025-03-15 01:01:15,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:15,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:15,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:15,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:15,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:15,894 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 435 [2025-03-15 01:01:15,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 346 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 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:01:15,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:15,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 435 [2025-03-15 01:01:15,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:16,150 INFO L124 PetriNetUnfolderBase]: 454/1209 cut-off events. [2025-03-15 01:01:16,151 INFO L125 PetriNetUnfolderBase]: For 330/480 co-relation queries the response was YES. [2025-03-15 01:01:16,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2574 conditions, 1209 events. 454/1209 cut-off events. For 330/480 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5158 event pairs, 272 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 2092. Up to 618 conditions per place. [2025-03-15 01:01:16,161 INFO L140 encePairwiseOnDemand]: 432/435 looper letters, 29 selfloop transitions, 2 changer transitions 15/345 dead transitions. [2025-03-15 01:01:16,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 345 transitions, 838 flow [2025-03-15 01:01:16,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:16,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1004 transitions. [2025-03-15 01:01:16,164 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7693486590038314 [2025-03-15 01:01:16,165 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -79 predicate places. [2025-03-15 01:01:16,165 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 345 transitions, 838 flow [2025-03-15 01:01:16,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 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:01:16,168 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:16,168 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:01:16,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:01:16,168 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:16,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:16,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1860151980, now seen corresponding path program 1 times [2025-03-15 01:01:16,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:16,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606283112] [2025-03-15 01:01:16,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:16,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:16,226 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:01:16,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:16,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606283112] [2025-03-15 01:01:16,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606283112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:16,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:16,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:16,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938507589] [2025-03-15 01:01:16,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:16,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:16,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:16,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:16,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:16,229 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 435 [2025-03-15 01:01:16,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 345 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 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:01:16,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:16,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 435 [2025-03-15 01:01:16,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:16,529 INFO L124 PetriNetUnfolderBase]: 454/1208 cut-off events. [2025-03-15 01:01:16,530 INFO L125 PetriNetUnfolderBase]: For 618/918 co-relation queries the response was YES. [2025-03-15 01:01:16,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3190 conditions, 1208 events. 454/1208 cut-off events. For 618/918 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5174 event pairs, 272 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 2659. Up to 618 conditions per place. [2025-03-15 01:01:16,538 INFO L140 encePairwiseOnDemand]: 432/435 looper letters, 26 selfloop transitions, 2 changer transitions 15/344 dead transitions. [2025-03-15 01:01:16,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 344 transitions, 892 flow [2025-03-15 01:01:16,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:16,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:16,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2025-03-15 01:01:16,542 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7739463601532567 [2025-03-15 01:01:16,544 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -78 predicate places. [2025-03-15 01:01:16,544 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 344 transitions, 892 flow [2025-03-15 01:01:16,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 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:01:16,544 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:16,545 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:01:16,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:01:16,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:16,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:16,546 INFO L85 PathProgramCache]: Analyzing trace with hash -433531164, now seen corresponding path program 1 times [2025-03-15 01:01:16,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:16,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365266956] [2025-03-15 01:01:16,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:16,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:16,605 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:01:16,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:16,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365266956] [2025-03-15 01:01:16,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365266956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:16,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:16,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:16,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848577384] [2025-03-15 01:01:16,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:16,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:16,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:16,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:16,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:16,607 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 435 [2025-03-15 01:01:16,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 344 transitions, 892 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 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:01:16,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:16,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 435 [2025-03-15 01:01:16,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:16,865 INFO L124 PetriNetUnfolderBase]: 454/1207 cut-off events. [2025-03-15 01:01:16,866 INFO L125 PetriNetUnfolderBase]: For 1022/1472 co-relation queries the response was YES. [2025-03-15 01:01:16,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3806 conditions, 1207 events. 454/1207 cut-off events. For 1022/1472 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5215 event pairs, 272 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 3226. Up to 618 conditions per place. [2025-03-15 01:01:16,872 INFO L140 encePairwiseOnDemand]: 432/435 looper letters, 26 selfloop transitions, 2 changer transitions 15/343 dead transitions. [2025-03-15 01:01:16,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 343 transitions, 946 flow [2025-03-15 01:01:16,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:16,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2025-03-15 01:01:16,874 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7739463601532567 [2025-03-15 01:01:16,875 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -77 predicate places. [2025-03-15 01:01:16,875 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 343 transitions, 946 flow [2025-03-15 01:01:16,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 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:01:16,875 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:16,876 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:01:16,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:01:16,876 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:16,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:16,876 INFO L85 PathProgramCache]: Analyzing trace with hash -65941665, now seen corresponding path program 1 times [2025-03-15 01:01:16,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:16,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001868886] [2025-03-15 01:01:16,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:16,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:16,933 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:01:16,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:16,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001868886] [2025-03-15 01:01:16,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001868886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:16,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:16,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:16,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154416591] [2025-03-15 01:01:16,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:16,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:16,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:16,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:16,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:16,935 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 435 [2025-03-15 01:01:16,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 343 transitions, 946 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 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:01:16,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:16,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 435 [2025-03-15 01:01:16,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:17,150 INFO L124 PetriNetUnfolderBase]: 454/1206 cut-off events. [2025-03-15 01:01:17,151 INFO L125 PetriNetUnfolderBase]: For 1542/2142 co-relation queries the response was YES. [2025-03-15 01:01:17,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4422 conditions, 1206 events. 454/1206 cut-off events. For 1542/2142 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5159 event pairs, 272 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 3793. Up to 618 conditions per place. [2025-03-15 01:01:17,161 INFO L140 encePairwiseOnDemand]: 432/435 looper letters, 26 selfloop transitions, 2 changer transitions 15/342 dead transitions. [2025-03-15 01:01:17,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 342 transitions, 1000 flow [2025-03-15 01:01:17,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2025-03-15 01:01:17,163 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7739463601532567 [2025-03-15 01:01:17,165 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -76 predicate places. [2025-03-15 01:01:17,166 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 342 transitions, 1000 flow [2025-03-15 01:01:17,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 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:01:17,166 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:17,166 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] [2025-03-15 01:01:17,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:01:17,166 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:17,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:17,168 INFO L85 PathProgramCache]: Analyzing trace with hash -888485274, now seen corresponding path program 1 times [2025-03-15 01:01:17,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:17,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569007050] [2025-03-15 01:01:17,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:17,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:17,219 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:01:17,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:17,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569007050] [2025-03-15 01:01:17,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569007050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:17,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:17,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:17,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792564440] [2025-03-15 01:01:17,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:17,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:17,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:17,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:17,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:17,221 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 435 [2025-03-15 01:01:17,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 342 transitions, 1000 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 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:01:17,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:17,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 435 [2025-03-15 01:01:17,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:17,463 INFO L124 PetriNetUnfolderBase]: 454/1205 cut-off events. [2025-03-15 01:01:17,463 INFO L125 PetriNetUnfolderBase]: For 2178/2928 co-relation queries the response was YES. [2025-03-15 01:01:17,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5038 conditions, 1205 events. 454/1205 cut-off events. For 2178/2928 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5140 event pairs, 272 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 4360. Up to 618 conditions per place. [2025-03-15 01:01:17,475 INFO L140 encePairwiseOnDemand]: 432/435 looper letters, 26 selfloop transitions, 2 changer transitions 15/341 dead transitions. [2025-03-15 01:01:17,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 341 transitions, 1054 flow [2025-03-15 01:01:17,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:17,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2025-03-15 01:01:17,477 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7739463601532567 [2025-03-15 01:01:17,479 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -75 predicate places. [2025-03-15 01:01:17,479 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 341 transitions, 1054 flow [2025-03-15 01:01:17,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 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:01:17,480 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:17,480 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] [2025-03-15 01:01:17,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:01:17,481 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:17,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:17,481 INFO L85 PathProgramCache]: Analyzing trace with hash -319056218, now seen corresponding path program 1 times [2025-03-15 01:01:17,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:17,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936869249] [2025-03-15 01:01:17,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:17,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:17,539 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:01:17,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:17,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936869249] [2025-03-15 01:01:17,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936869249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:17,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:17,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:17,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147170591] [2025-03-15 01:01:17,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:17,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:17,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:17,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:17,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:17,541 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 435 [2025-03-15 01:01:17,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 341 transitions, 1054 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 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:01:17,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:17,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 435 [2025-03-15 01:01:17,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:17,773 INFO L124 PetriNetUnfolderBase]: 454/1204 cut-off events. [2025-03-15 01:01:17,773 INFO L125 PetriNetUnfolderBase]: For 2930/3830 co-relation queries the response was YES. [2025-03-15 01:01:17,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5654 conditions, 1204 events. 454/1204 cut-off events. For 2930/3830 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5208 event pairs, 272 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 4927. Up to 618 conditions per place. [2025-03-15 01:01:17,789 INFO L140 encePairwiseOnDemand]: 432/435 looper letters, 26 selfloop transitions, 2 changer transitions 15/340 dead transitions. [2025-03-15 01:01:17,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 340 transitions, 1108 flow [2025-03-15 01:01:17,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2025-03-15 01:01:17,793 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7739463601532567 [2025-03-15 01:01:17,795 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -74 predicate places. [2025-03-15 01:01:17,795 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 340 transitions, 1108 flow [2025-03-15 01:01:17,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 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:01:17,796 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:17,796 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] [2025-03-15 01:01:17,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:01:17,796 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:17,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:17,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2080726013, now seen corresponding path program 1 times [2025-03-15 01:01:17,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:17,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395008921] [2025-03-15 01:01:17,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:17,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:17,866 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:01:17,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:17,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395008921] [2025-03-15 01:01:17,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395008921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:17,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:17,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:17,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746885823] [2025-03-15 01:01:17,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:17,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:17,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:17,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:17,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:17,868 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 435 [2025-03-15 01:01:17,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 340 transitions, 1108 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 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:01:17,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:17,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 435 [2025-03-15 01:01:17,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:18,161 INFO L124 PetriNetUnfolderBase]: 454/1203 cut-off events. [2025-03-15 01:01:18,161 INFO L125 PetriNetUnfolderBase]: For 3798/4848 co-relation queries the response was YES. [2025-03-15 01:01:18,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6270 conditions, 1203 events. 454/1203 cut-off events. For 3798/4848 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5216 event pairs, 272 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 5494. Up to 618 conditions per place. [2025-03-15 01:01:18,175 INFO L140 encePairwiseOnDemand]: 432/435 looper letters, 26 selfloop transitions, 2 changer transitions 15/339 dead transitions. [2025-03-15 01:01:18,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 339 transitions, 1162 flow [2025-03-15 01:01:18,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:18,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2025-03-15 01:01:18,177 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7739463601532567 [2025-03-15 01:01:18,178 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -73 predicate places. [2025-03-15 01:01:18,178 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 339 transitions, 1162 flow [2025-03-15 01:01:18,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 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:01:18,178 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:18,179 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] [2025-03-15 01:01:18,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:01:18,179 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:18,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:18,179 INFO L85 PathProgramCache]: Analyzing trace with hash -947551289, now seen corresponding path program 1 times [2025-03-15 01:01:18,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:18,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137006575] [2025-03-15 01:01:18,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:18,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:18,220 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:01:18,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:18,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137006575] [2025-03-15 01:01:18,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137006575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:18,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:18,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:18,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962145162] [2025-03-15 01:01:18,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:18,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:18,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:18,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:18,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:18,223 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 435 [2025-03-15 01:01:18,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 339 transitions, 1162 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 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:01:18,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:18,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 435 [2025-03-15 01:01:18,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:18,505 INFO L124 PetriNetUnfolderBase]: 454/1202 cut-off events. [2025-03-15 01:01:18,505 INFO L125 PetriNetUnfolderBase]: For 4782/5982 co-relation queries the response was YES. [2025-03-15 01:01:18,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6886 conditions, 1202 events. 454/1202 cut-off events. For 4782/5982 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5178 event pairs, 272 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 6061. Up to 618 conditions per place. [2025-03-15 01:01:18,515 INFO L140 encePairwiseOnDemand]: 432/435 looper letters, 26 selfloop transitions, 2 changer transitions 15/338 dead transitions. [2025-03-15 01:01:18,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 338 transitions, 1216 flow [2025-03-15 01:01:18,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:18,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2025-03-15 01:01:18,517 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7739463601532567 [2025-03-15 01:01:18,518 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -72 predicate places. [2025-03-15 01:01:18,518 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 338 transitions, 1216 flow [2025-03-15 01:01:18,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 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:01:18,519 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:18,519 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] [2025-03-15 01:01:18,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:01:18,519 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:18,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:18,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1046411704, now seen corresponding path program 1 times [2025-03-15 01:01:18,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:18,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014742251] [2025-03-15 01:01:18,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:18,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:18,554 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:01:18,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:18,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014742251] [2025-03-15 01:01:18,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014742251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:18,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:18,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:18,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356385842] [2025-03-15 01:01:18,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:18,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:18,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:18,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:18,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:18,556 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 435 [2025-03-15 01:01:18,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 338 transitions, 1216 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 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:01:18,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:18,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 435 [2025-03-15 01:01:18,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:18,729 INFO L124 PetriNetUnfolderBase]: 454/1201 cut-off events. [2025-03-15 01:01:18,730 INFO L125 PetriNetUnfolderBase]: For 5874/7224 co-relation queries the response was YES. [2025-03-15 01:01:18,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7497 conditions, 1201 events. 454/1201 cut-off events. For 5874/7224 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5204 event pairs, 272 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 6628. Up to 618 conditions per place. [2025-03-15 01:01:18,741 INFO L140 encePairwiseOnDemand]: 433/435 looper letters, 23 selfloop transitions, 1 changer transitions 15/337 dead transitions. [2025-03-15 01:01:18,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 337 transitions, 1260 flow [2025-03-15 01:01:18,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:18,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:18,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1018 transitions. [2025-03-15 01:01:18,744 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7800766283524905 [2025-03-15 01:01:18,744 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -71 predicate places. [2025-03-15 01:01:18,744 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 337 transitions, 1260 flow [2025-03-15 01:01:18,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 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:01:18,745 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:18,745 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] [2025-03-15 01:01:18,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:01:18,745 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:18,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:18,746 INFO L85 PathProgramCache]: Analyzing trace with hash 36321232, now seen corresponding path program 1 times [2025-03-15 01:01:18,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:18,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388645712] [2025-03-15 01:01:18,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:18,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:19,265 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:01:19,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:19,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388645712] [2025-03-15 01:01:19,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388645712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:19,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:19,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:01:19,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300760646] [2025-03-15 01:01:19,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:19,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:01:19,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:19,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:01:19,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:01:19,267 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 435 [2025-03-15 01:01:19,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 337 transitions, 1260 flow. Second operand has 6 states, 6 states have (on average 300.8333333333333) internal successors, (1805), 6 states have internal predecessors, (1805), 0 states have call successors, (0), 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:01:19,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:19,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 435 [2025-03-15 01:01:19,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:19,478 INFO L124 PetriNetUnfolderBase]: 454/1199 cut-off events. [2025-03-15 01:01:19,478 INFO L125 PetriNetUnfolderBase]: For 7080/8580 co-relation queries the response was YES. [2025-03-15 01:01:19,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8140 conditions, 1199 events. 454/1199 cut-off events. For 7080/8580 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5157 event pairs, 272 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 7195. Up to 635 conditions per place. [2025-03-15 01:01:19,493 INFO L140 encePairwiseOnDemand]: 423/435 looper letters, 46 selfloop transitions, 10 changer transitions 15/335 dead transitions. [2025-03-15 01:01:19,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 335 transitions, 1368 flow [2025-03-15 01:01:19,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:01:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:01:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1852 transitions. [2025-03-15 01:01:19,497 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7095785440613027 [2025-03-15 01:01:19,498 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -68 predicate places. [2025-03-15 01:01:19,498 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 335 transitions, 1368 flow [2025-03-15 01:01:19,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 300.8333333333333) internal successors, (1805), 6 states have internal predecessors, (1805), 0 states have call successors, (0), 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:01:19,499 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:19,500 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] [2025-03-15 01:01:19,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:01:19,500 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:19,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:19,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1811197420, now seen corresponding path program 1 times [2025-03-15 01:01:19,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:19,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980914310] [2025-03-15 01:01:19,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:19,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:19,551 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:01:19,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:19,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980914310] [2025-03-15 01:01:19,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980914310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:19,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:19,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:19,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212064771] [2025-03-15 01:01:19,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:19,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:19,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:19,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:19,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:19,552 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 435 [2025-03-15 01:01:19,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 335 transitions, 1368 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 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:01:19,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:19,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 435 [2025-03-15 01:01:19,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:19,785 INFO L124 PetriNetUnfolderBase]: 454/1198 cut-off events. [2025-03-15 01:01:19,786 INFO L125 PetriNetUnfolderBase]: For 8410/10060 co-relation queries the response was YES. [2025-03-15 01:01:19,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8753 conditions, 1198 events. 454/1198 cut-off events. For 8410/10060 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5206 event pairs, 272 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 7762. Up to 635 conditions per place. [2025-03-15 01:01:19,802 INFO L140 encePairwiseOnDemand]: 432/435 looper letters, 23 selfloop transitions, 2 changer transitions 15/334 dead transitions. [2025-03-15 01:01:19,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 334 transitions, 1416 flow [2025-03-15 01:01:19,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:19,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:19,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2025-03-15 01:01:19,804 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.778544061302682 [2025-03-15 01:01:19,804 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -67 predicate places. [2025-03-15 01:01:19,804 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 334 transitions, 1416 flow [2025-03-15 01:01:19,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 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:01:19,805 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:19,805 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:01:19,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:01:19,805 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:19,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:19,806 INFO L85 PathProgramCache]: Analyzing trace with hash 515392843, now seen corresponding path program 1 times [2025-03-15 01:01:19,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:19,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157890683] [2025-03-15 01:01:19,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:19,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:19,840 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:01:19,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:19,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157890683] [2025-03-15 01:01:19,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157890683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:19,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:19,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:19,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004496232] [2025-03-15 01:01:19,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:19,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:19,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:19,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:19,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:19,843 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 435 [2025-03-15 01:01:19,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 334 transitions, 1416 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 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:01:19,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:19,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 435 [2025-03-15 01:01:19,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:20,075 INFO L124 PetriNetUnfolderBase]: 454/1197 cut-off events. [2025-03-15 01:01:20,076 INFO L125 PetriNetUnfolderBase]: For 9847/11647 co-relation queries the response was YES. [2025-03-15 01:01:20,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9364 conditions, 1197 events. 454/1197 cut-off events. For 9847/11647 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5166 event pairs, 272 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 8329. Up to 635 conditions per place. [2025-03-15 01:01:20,090 INFO L140 encePairwiseOnDemand]: 433/435 looper letters, 23 selfloop transitions, 1 changer transitions 15/333 dead transitions. [2025-03-15 01:01:20,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 333 transitions, 1460 flow [2025-03-15 01:01:20,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1018 transitions. [2025-03-15 01:01:20,093 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7800766283524905 [2025-03-15 01:01:20,093 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -66 predicate places. [2025-03-15 01:01:20,093 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 333 transitions, 1460 flow [2025-03-15 01:01:20,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 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:01:20,094 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:20,094 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:01:20,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:01:20,094 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:20,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:20,096 INFO L85 PathProgramCache]: Analyzing trace with hash -93215858, now seen corresponding path program 1 times [2025-03-15 01:01:20,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:20,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314437993] [2025-03-15 01:01:20,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:20,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:20,150 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:01:20,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:20,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314437993] [2025-03-15 01:01:20,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314437993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:20,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:20,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:20,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132330171] [2025-03-15 01:01:20,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:20,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:20,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:20,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:20,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:20,152 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 435 [2025-03-15 01:01:20,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 333 transitions, 1460 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 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:01:20,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:20,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 435 [2025-03-15 01:01:20,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:20,406 INFO L124 PetriNetUnfolderBase]: 454/1196 cut-off events. [2025-03-15 01:01:20,406 INFO L125 PetriNetUnfolderBase]: For 11408/13358 co-relation queries the response was YES. [2025-03-15 01:01:20,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9977 conditions, 1196 events. 454/1196 cut-off events. For 11408/13358 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5220 event pairs, 272 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 8896. Up to 635 conditions per place. [2025-03-15 01:01:20,419 INFO L140 encePairwiseOnDemand]: 432/435 looper letters, 23 selfloop transitions, 2 changer transitions 15/332 dead transitions. [2025-03-15 01:01:20,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 332 transitions, 1508 flow [2025-03-15 01:01:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:20,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:20,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2025-03-15 01:01:20,421 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.778544061302682 [2025-03-15 01:01:20,422 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -65 predicate places. [2025-03-15 01:01:20,422 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 332 transitions, 1508 flow [2025-03-15 01:01:20,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 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:01:20,423 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:20,423 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:01:20,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:01:20,423 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:20,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:20,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1581670725, now seen corresponding path program 1 times [2025-03-15 01:01:20,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:20,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406415485] [2025-03-15 01:01:20,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:20,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:20,471 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:01:20,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:20,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406415485] [2025-03-15 01:01:20,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406415485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:20,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:20,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:20,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654881682] [2025-03-15 01:01:20,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:20,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:20,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:20,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:20,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:20,473 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 435 [2025-03-15 01:01:20,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 332 transitions, 1508 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 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:01:20,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:20,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 435 [2025-03-15 01:01:20,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:20,664 INFO L124 PetriNetUnfolderBase]: 454/1194 cut-off events. [2025-03-15 01:01:20,665 INFO L125 PetriNetUnfolderBase]: For 13076/15176 co-relation queries the response was YES. [2025-03-15 01:01:20,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10588 conditions, 1194 events. 454/1194 cut-off events. For 13076/15176 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5202 event pairs, 272 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 9463. Up to 635 conditions per place. [2025-03-15 01:01:20,679 INFO L140 encePairwiseOnDemand]: 432/435 looper letters, 25 selfloop transitions, 1 changer transitions 15/330 dead transitions. [2025-03-15 01:01:20,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 330 transitions, 1552 flow [2025-03-15 01:01:20,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:20,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2025-03-15 01:01:20,681 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7754789272030651 [2025-03-15 01:01:20,682 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -65 predicate places. [2025-03-15 01:01:20,682 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 330 transitions, 1552 flow [2025-03-15 01:01:20,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 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:01:20,683 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:20,683 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] [2025-03-15 01:01:20,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:01:20,683 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:20,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:20,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1331120417, now seen corresponding path program 1 times [2025-03-15 01:01:20,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:20,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392801266] [2025-03-15 01:01:20,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:20,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:20,747 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:01:20,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:20,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392801266] [2025-03-15 01:01:20,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392801266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:20,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:20,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:20,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022760454] [2025-03-15 01:01:20,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:20,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:20,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:20,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:20,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:20,750 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 435 [2025-03-15 01:01:20,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 330 transitions, 1552 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 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:01:20,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:20,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 435 [2025-03-15 01:01:20,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:20,950 INFO L124 PetriNetUnfolderBase]: 454/1193 cut-off events. [2025-03-15 01:01:20,950 INFO L125 PetriNetUnfolderBase]: For 14858/17108 co-relation queries the response was YES. [2025-03-15 01:01:20,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11199 conditions, 1193 events. 454/1193 cut-off events. For 14858/17108 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5170 event pairs, 272 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 10030. Up to 635 conditions per place. [2025-03-15 01:01:20,965 INFO L140 encePairwiseOnDemand]: 433/435 looper letters, 23 selfloop transitions, 1 changer transitions 15/329 dead transitions. [2025-03-15 01:01:20,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 329 transitions, 1596 flow [2025-03-15 01:01:20,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:20,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:20,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1018 transitions. [2025-03-15 01:01:20,968 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7800766283524905 [2025-03-15 01:01:20,968 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -64 predicate places. [2025-03-15 01:01:20,968 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 329 transitions, 1596 flow [2025-03-15 01:01:20,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 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:01:20,969 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:20,970 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:01:20,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:01:20,970 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:20,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:20,971 INFO L85 PathProgramCache]: Analyzing trace with hash 693598889, now seen corresponding path program 1 times [2025-03-15 01:01:20,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:20,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298329796] [2025-03-15 01:01:20,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:20,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:21,013 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:01:21,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:21,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298329796] [2025-03-15 01:01:21,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298329796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:21,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:21,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:21,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695254463] [2025-03-15 01:01:21,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:21,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:21,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:21,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:21,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:21,015 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 435 [2025-03-15 01:01:21,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 329 transitions, 1596 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 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:01:21,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:21,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 435 [2025-03-15 01:01:21,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:21,203 INFO L124 PetriNetUnfolderBase]: 454/1191 cut-off events. [2025-03-15 01:01:21,203 INFO L125 PetriNetUnfolderBase]: For 16756/19156 co-relation queries the response was YES. [2025-03-15 01:01:21,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11810 conditions, 1191 events. 454/1191 cut-off events. For 16756/19156 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5191 event pairs, 272 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 10597. Up to 635 conditions per place. [2025-03-15 01:01:21,218 INFO L140 encePairwiseOnDemand]: 432/435 looper letters, 25 selfloop transitions, 1 changer transitions 15/327 dead transitions. [2025-03-15 01:01:21,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 327 transitions, 1640 flow [2025-03-15 01:01:21,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2025-03-15 01:01:21,220 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7754789272030651 [2025-03-15 01:01:21,220 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -64 predicate places. [2025-03-15 01:01:21,220 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 327 transitions, 1640 flow [2025-03-15 01:01:21,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 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:01:21,221 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:21,221 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:01:21,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 01:01:21,221 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:21,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:21,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1478090971, now seen corresponding path program 1 times [2025-03-15 01:01:21,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:21,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671326487] [2025-03-15 01:01:21,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:21,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:21,274 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:01:21,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:21,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671326487] [2025-03-15 01:01:21,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671326487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:21,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:21,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:21,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093557760] [2025-03-15 01:01:21,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:21,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:21,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:21,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:21,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:21,275 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 435 [2025-03-15 01:01:21,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 327 transitions, 1640 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 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:01:21,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:21,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 435 [2025-03-15 01:01:21,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:21,625 INFO L124 PetriNetUnfolderBase]: 761/1941 cut-off events. [2025-03-15 01:01:21,625 INFO L125 PetriNetUnfolderBase]: For 36646/41440 co-relation queries the response was YES. [2025-03-15 01:01:21,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20810 conditions, 1941 events. 761/1941 cut-off events. For 36646/41440 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 10605 event pairs, 443 based on Foata normal form. 0/1727 useless extension candidates. Maximal degree in co-relation 11164. Up to 1054 conditions per place. [2025-03-15 01:01:21,652 INFO L140 encePairwiseOnDemand]: 432/435 looper letters, 41 selfloop transitions, 2 changer transitions 15/345 dead transitions. [2025-03-15 01:01:21,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 345 transitions, 2430 flow [2025-03-15 01:01:21,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1037 transitions. [2025-03-15 01:01:21,657 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7946360153256705 [2025-03-15 01:01:21,657 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -63 predicate places. [2025-03-15 01:01:21,657 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 345 transitions, 2430 flow [2025-03-15 01:01:21,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 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:01:21,657 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:21,657 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:01:21,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 01:01:21,658 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:21,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:21,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1193598022, now seen corresponding path program 1 times [2025-03-15 01:01:21,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:21,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929253946] [2025-03-15 01:01:21,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:21,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:21,715 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:01:21,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:21,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929253946] [2025-03-15 01:01:21,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929253946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:21,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:21,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:21,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584386891] [2025-03-15 01:01:21,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:21,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:21,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:21,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:21,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:21,719 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 435 [2025-03-15 01:01:21,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 345 transitions, 2430 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 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:01:21,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:21,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 435 [2025-03-15 01:01:21,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:22,380 INFO L124 PetriNetUnfolderBase]: 1322/3223 cut-off events. [2025-03-15 01:01:22,381 INFO L125 PetriNetUnfolderBase]: For 72847/82711 co-relation queries the response was YES. [2025-03-15 01:01:22,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37904 conditions, 3223 events. 1322/3223 cut-off events. For 72847/82711 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 21160 event pairs, 755 based on Foata normal form. 0/2856 useless extension candidates. Maximal degree in co-relation 11731. Up to 1822 conditions per place. [2025-03-15 01:01:22,510 INFO L140 encePairwiseOnDemand]: 432/435 looper letters, 77 selfloop transitions, 3 changer transitions 15/381 dead transitions. [2025-03-15 01:01:22,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 381 transitions, 4040 flow [2025-03-15 01:01:22,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1037 transitions. [2025-03-15 01:01:22,512 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7946360153256705 [2025-03-15 01:01:22,512 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -62 predicate places. [2025-03-15 01:01:22,512 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 381 transitions, 4040 flow [2025-03-15 01:01:22,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 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:01:22,513 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:22,513 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:01:22,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 01:01:22,513 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:22,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:22,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1188688021, now seen corresponding path program 1 times [2025-03-15 01:01:22,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:22,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70215807] [2025-03-15 01:01:22,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:22,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:22,565 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:01:22,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:22,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70215807] [2025-03-15 01:01:22,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70215807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:22,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:22,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:22,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332495122] [2025-03-15 01:01:22,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:22,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:22,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:22,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:22,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:22,569 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 435 [2025-03-15 01:01:22,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 381 transitions, 4040 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 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:01:22,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:22,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 435 [2025-03-15 01:01:22,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:23,680 INFO L124 PetriNetUnfolderBase]: 2007/4902 cut-off events. [2025-03-15 01:01:23,680 INFO L125 PetriNetUnfolderBase]: For 132032/146624 co-relation queries the response was YES. [2025-03-15 01:01:23,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60256 conditions, 4902 events. 2007/4902 cut-off events. For 132032/146624 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 36930 event pairs, 774 based on Foata normal form. 0/4321 useless extension candidates. Maximal degree in co-relation 19488. Up to 2756 conditions per place. [2025-03-15 01:01:23,759 INFO L140 encePairwiseOnDemand]: 431/435 looper letters, 133 selfloop transitions, 9 changer transitions 15/442 dead transitions. [2025-03-15 01:01:23,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 442 transitions, 6872 flow [2025-03-15 01:01:23,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:23,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1038 transitions. [2025-03-15 01:01:23,761 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7954022988505747 [2025-03-15 01:01:23,761 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -61 predicate places. [2025-03-15 01:01:23,761 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 442 transitions, 6872 flow [2025-03-15 01:01:23,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 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:01:23,762 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:23,762 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, 1, 1] [2025-03-15 01:01:23,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 01:01:23,762 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:23,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:23,763 INFO L85 PathProgramCache]: Analyzing trace with hash -291378104, now seen corresponding path program 1 times [2025-03-15 01:01:23,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:23,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652901838] [2025-03-15 01:01:23,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:23,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:23,798 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:01:23,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:23,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652901838] [2025-03-15 01:01:23,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652901838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:23,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:23,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:23,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800841930] [2025-03-15 01:01:23,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:23,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:23,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:23,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:23,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:23,800 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 435 [2025-03-15 01:01:23,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 442 transitions, 6872 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 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:01:23,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:23,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 435 [2025-03-15 01:01:23,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:25,253 INFO L124 PetriNetUnfolderBase]: 2826/6900 cut-off events. [2025-03-15 01:01:25,253 INFO L125 PetriNetUnfolderBase]: For 201959/219402 co-relation queries the response was YES. [2025-03-15 01:01:25,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88794 conditions, 6900 events. 2826/6900 cut-off events. For 201959/219402 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 56691 event pairs, 683 based on Foata normal form. 4/6124 useless extension candidates. Maximal degree in co-relation 29632. Up to 3881 conditions per place. [2025-03-15 01:01:25,358 INFO L140 encePairwiseOnDemand]: 431/435 looper letters, 234 selfloop transitions, 17 changer transitions 15/550 dead transitions. [2025-03-15 01:01:25,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 550 transitions, 12065 flow [2025-03-15 01:01:25,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:25,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1038 transitions. [2025-03-15 01:01:25,360 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7954022988505747 [2025-03-15 01:01:25,361 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -60 predicate places. [2025-03-15 01:01:25,361 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 550 transitions, 12065 flow [2025-03-15 01:01:25,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 0 states have call successors, (0), 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:01:25,361 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:25,361 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:25,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 01:01:25,361 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:25,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:25,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1881417523, now seen corresponding path program 1 times [2025-03-15 01:01:25,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:25,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332136196] [2025-03-15 01:01:25,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:25,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:25,409 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:01:25,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:25,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332136196] [2025-03-15 01:01:25,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332136196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:25,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:25,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:25,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655838744] [2025-03-15 01:01:25,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:25,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:25,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:25,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:25,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:25,411 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 435 [2025-03-15 01:01:25,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 550 transitions, 12065 flow. Second operand has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 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:01:25,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:25,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 435 [2025-03-15 01:01:25,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:27,164 INFO L124 PetriNetUnfolderBase]: 2826/6804 cut-off events. [2025-03-15 01:01:27,165 INFO L125 PetriNetUnfolderBase]: For 213262/230429 co-relation queries the response was YES. [2025-03-15 01:01:27,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92585 conditions, 6804 events. 2826/6804 cut-off events. For 213262/230429 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 55255 event pairs, 610 based on Foata normal form. 1/6073 useless extension candidates. Maximal degree in co-relation 30939. Up to 3881 conditions per place. [2025-03-15 01:01:27,214 INFO L140 encePairwiseOnDemand]: 433/435 looper letters, 0 selfloop transitions, 0 changer transitions 549/549 dead transitions. [2025-03-15 01:01:27,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 549 transitions, 12561 flow [2025-03-15 01:01:27,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:27,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:27,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1025 transitions. [2025-03-15 01:01:27,216 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7854406130268199 [2025-03-15 01:01:27,217 INFO L298 CegarLoopForPetriNet]: 431 programPoint places, -59 predicate places. [2025-03-15 01:01:27,217 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 549 transitions, 12561 flow [2025-03-15 01:01:27,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 0 states have call successors, (0), 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:01:27,235 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/popl20-bad-buffer-mult-alt2.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 01:01:27,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (168 of 169 remaining) [2025-03-15 01:01:27,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (167 of 169 remaining) [2025-03-15 01:01:27,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (166 of 169 remaining) [2025-03-15 01:01:27,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (165 of 169 remaining) [2025-03-15 01:01:27,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (164 of 169 remaining) [2025-03-15 01:01:27,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (163 of 169 remaining) [2025-03-15 01:01:27,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (162 of 169 remaining) [2025-03-15 01:01:27,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (161 of 169 remaining) [2025-03-15 01:01:27,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (160 of 169 remaining) [2025-03-15 01:01:27,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (159 of 169 remaining) [2025-03-15 01:01:27,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (158 of 169 remaining) [2025-03-15 01:01:27,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (157 of 169 remaining) [2025-03-15 01:01:27,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (156 of 169 remaining) [2025-03-15 01:01:27,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (155 of 169 remaining) [2025-03-15 01:01:27,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (154 of 169 remaining) [2025-03-15 01:01:27,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (153 of 169 remaining) [2025-03-15 01:01:27,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (152 of 169 remaining) [2025-03-15 01:01:27,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (151 of 169 remaining) [2025-03-15 01:01:27,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (150 of 169 remaining) [2025-03-15 01:01:27,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (149 of 169 remaining) [2025-03-15 01:01:27,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (148 of 169 remaining) [2025-03-15 01:01:27,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (147 of 169 remaining) [2025-03-15 01:01:27,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (146 of 169 remaining) [2025-03-15 01:01:27,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (145 of 169 remaining) [2025-03-15 01:01:27,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (144 of 169 remaining) [2025-03-15 01:01:27,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (143 of 169 remaining) [2025-03-15 01:01:27,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (142 of 169 remaining) [2025-03-15 01:01:27,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (141 of 169 remaining) [2025-03-15 01:01:27,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (140 of 169 remaining) [2025-03-15 01:01:27,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (139 of 169 remaining) [2025-03-15 01:01:27,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (138 of 169 remaining) [2025-03-15 01:01:27,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (137 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (136 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (135 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (134 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (133 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (132 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (131 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (130 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (129 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (128 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (127 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (126 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (125 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (124 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (123 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (122 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (121 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (120 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (119 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (118 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (117 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (116 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (115 of 169 remaining) [2025-03-15 01:01:27,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (114 of 169 remaining) [2025-03-15 01:01:27,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (113 of 169 remaining) [2025-03-15 01:01:27,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (112 of 169 remaining) [2025-03-15 01:01:27,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (111 of 169 remaining) [2025-03-15 01:01:27,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (110 of 169 remaining) [2025-03-15 01:01:27,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (109 of 169 remaining) [2025-03-15 01:01:27,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (108 of 169 remaining) [2025-03-15 01:01:27,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (107 of 169 remaining) [2025-03-15 01:01:27,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (106 of 169 remaining) [2025-03-15 01:01:27,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (105 of 169 remaining) [2025-03-15 01:01:27,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (104 of 169 remaining) [2025-03-15 01:01:27,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (103 of 169 remaining) [2025-03-15 01:01:27,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (102 of 169 remaining) [2025-03-15 01:01:27,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (101 of 169 remaining) [2025-03-15 01:01:27,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (100 of 169 remaining) [2025-03-15 01:01:27,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (99 of 169 remaining) [2025-03-15 01:01:27,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (98 of 169 remaining) [2025-03-15 01:01:27,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (97 of 169 remaining) [2025-03-15 01:01:27,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (96 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (95 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (94 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (93 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (92 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (91 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (89 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (88 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (87 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (86 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (85 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (84 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (83 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (82 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (81 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (80 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (79 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (78 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (77 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (76 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (75 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (74 of 169 remaining) [2025-03-15 01:01:27,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (73 of 169 remaining) [2025-03-15 01:01:27,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (72 of 169 remaining) [2025-03-15 01:01:27,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (71 of 169 remaining) [2025-03-15 01:01:27,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (70 of 169 remaining) [2025-03-15 01:01:27,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (69 of 169 remaining) [2025-03-15 01:01:27,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (68 of 169 remaining) [2025-03-15 01:01:27,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (67 of 169 remaining) [2025-03-15 01:01:27,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (66 of 169 remaining) [2025-03-15 01:01:27,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (65 of 169 remaining) [2025-03-15 01:01:27,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (64 of 169 remaining) [2025-03-15 01:01:27,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (63 of 169 remaining) [2025-03-15 01:01:27,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (62 of 169 remaining) [2025-03-15 01:01:27,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (61 of 169 remaining) [2025-03-15 01:01:27,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (60 of 169 remaining) [2025-03-15 01:01:27,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (59 of 169 remaining) [2025-03-15 01:01:27,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (58 of 169 remaining) [2025-03-15 01:01:27,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (57 of 169 remaining) [2025-03-15 01:01:27,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (56 of 169 remaining) [2025-03-15 01:01:27,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (55 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (54 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (53 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (52 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (51 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (50 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (49 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (48 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (47 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (46 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (45 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (44 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (43 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (42 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (41 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (40 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (33 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 169 remaining) [2025-03-15 01:01:27,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (30 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (29 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (28 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (27 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (26 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (25 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (24 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (23 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (22 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (21 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (20 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (19 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (18 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (17 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (16 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (15 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (14 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (13 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (12 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (11 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (10 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (9 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (8 of 169 remaining) [2025-03-15 01:01:27,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (7 of 169 remaining) [2025-03-15 01:01:27,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 169 remaining) [2025-03-15 01:01:27,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (5 of 169 remaining) [2025-03-15 01:01:27,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (4 of 169 remaining) [2025-03-15 01:01:27,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (3 of 169 remaining) [2025-03-15 01:01:27,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (2 of 169 remaining) [2025-03-15 01:01:27,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (1 of 169 remaining) [2025-03-15 01:01:27,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (0 of 169 remaining) [2025-03-15 01:01:27,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 01:01:27,293 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:01:27,306 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:01:27,306 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:01:27,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:01:27 BasicIcfg [2025-03-15 01:01:27,310 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:01:27,310 INFO L158 Benchmark]: Toolchain (without parser) took 14096.32ms. Allocated memory was 71.3MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 44.4MB in the beginning and 936.2MB in the end (delta: -891.7MB). Peak memory consumption was 934.2MB. Max. memory is 8.0GB. [2025-03-15 01:01:27,311 INFO L158 Benchmark]: CDTParser took 1.29ms. Allocated memory is still 71.3MB. Free memory was 34.3MB in the beginning and 34.2MB in the end (delta: 42.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:01:27,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.95ms. Allocated memory is still 71.3MB. Free memory was 44.3MB in the beginning and 30.0MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 01:01:27,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.49ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 26.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:01:27,311 INFO L158 Benchmark]: Boogie Preprocessor took 42.10ms. Allocated memory is still 71.3MB. Free memory was 26.4MB in the beginning and 23.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:01:27,311 INFO L158 Benchmark]: RCFGBuilder took 1350.40ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 23.4MB in the beginning and 43.7MB in the end (delta: -20.3MB). Peak memory consumption was 34.0MB. Max. memory is 8.0GB. [2025-03-15 01:01:27,311 INFO L158 Benchmark]: TraceAbstraction took 12383.74ms. Allocated memory was 88.1MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 42.6MB in the beginning and 936.2MB in the end (delta: -893.5MB). Peak memory consumption was 912.7MB. Max. memory is 8.0GB. [2025-03-15 01:01:27,312 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.29ms. Allocated memory is still 71.3MB. Free memory was 34.3MB in the beginning and 34.2MB in the end (delta: 42.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.95ms. Allocated memory is still 71.3MB. Free memory was 44.3MB in the beginning and 30.0MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.49ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 26.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.10ms. Allocated memory is still 71.3MB. Free memory was 26.4MB in the beginning and 23.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 1350.40ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 23.4MB in the beginning and 43.7MB in the end (delta: -20.3MB). Peak memory consumption was 34.0MB. Max. memory is 8.0GB. * TraceAbstraction took 12383.74ms. Allocated memory was 88.1MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 42.6MB in the beginning and 936.2MB in the end (delta: -893.5MB). Peak memory consumption was 912.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: 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: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: 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: 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: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: 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: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: 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: 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: 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: 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: 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: 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 - 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, 525 locations, 169 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: 12.2s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 183 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 135 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1005 IncrementalHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 135 mSDtfsCounter, 1005 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12561occurred in iteration=22, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2754 NumberOfCodeBlocks, 2754 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2732 ConstructedInterpolants, 0 QuantifiedInterpolants, 2889 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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 95 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:01:27,327 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...