/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:59:56,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:59:56,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 00:59:56,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:59:56,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:59:56,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:59:56,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:59:56,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:59:56,325 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:59:56,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:59:56,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:59:56,325 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:59:56,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:59:56,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:59:56,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:59:56,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:59:56,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:59:56,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:59:56,327 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:59:56,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:59:56,328 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:59:56,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:59:56,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:59:56,328 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:59:56,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:59:56,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:59:56,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:59:56,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:59:56,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:59:56,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:59:56,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:59:56,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:59:56,329 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2025-03-15 00:59:56,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:59:56,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:59:56,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:59:56,585 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:59:56,585 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:59:56,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c [2025-03-15 00:59:57,772 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3402594c6/ac06dc3792474983bad2873dab267880/FLAGd953da845 [2025-03-15 00:59:57,956 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:59:57,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1.wvr.c [2025-03-15 00:59:57,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3402594c6/ac06dc3792474983bad2873dab267880/FLAGd953da845 [2025-03-15 00:59:57,979 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3402594c6/ac06dc3792474983bad2873dab267880 [2025-03-15 00:59:57,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:59:57,986 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:59:57,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:59:57,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:59:57,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:59:57,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:59:57" (1/1) ... [2025-03-15 00:59:57,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c8fee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:57, skipping insertion in model container [2025-03-15 00:59:57,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:59:57" (1/1) ... [2025-03-15 00:59:58,007 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:59:58,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:59:58,161 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:59:58,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:59:58,201 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:59:58,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:58 WrapperNode [2025-03-15 00:59:58,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:59:58,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:59:58,203 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:59:58,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:59:58,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:58" (1/1) ... [2025-03-15 00:59:58,219 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:58" (1/1) ... [2025-03-15 00:59:58,254 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 511 [2025-03-15 00:59:58,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:59:58,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:59:58,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:59:58,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:59:58,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:58" (1/1) ... [2025-03-15 00:59:58,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:58" (1/1) ... [2025-03-15 00:59:58,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:58" (1/1) ... [2025-03-15 00:59:58,272 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:58" (1/1) ... [2025-03-15 00:59:58,291 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:58" (1/1) ... [2025-03-15 00:59:58,292 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:58" (1/1) ... [2025-03-15 00:59:58,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:58" (1/1) ... [2025-03-15 00:59:58,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:58" (1/1) ... [2025-03-15 00:59:58,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:58" (1/1) ... [2025-03-15 00:59:58,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:59:58,309 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:59:58,309 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:59:58,309 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:59:58,310 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:58" (1/1) ... [2025-03-15 00:59:58,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:59:58,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:59:58,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 00:59:58,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 00:59:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:59:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:59:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:59:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 00:59:58,374 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 00:59:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 00:59:58,374 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 00:59:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 00:59:58,374 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 00:59:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-15 00:59:58,374 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-15 00:59:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:59:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 00:59:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 00:59:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 00:59:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:59:58,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:59:58,377 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 00:59:58,488 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:59:58,490 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:59:59,019 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:59:59,019 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:59:59,305 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:59:59,306 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-03-15 00:59:59,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:59:59 BoogieIcfgContainer [2025-03-15 00:59:59,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:59:59,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:59:59,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:59:59,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:59:59,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:59:57" (1/3) ... [2025-03-15 00:59:59,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66639870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:59:59, skipping insertion in model container [2025-03-15 00:59:59,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:58" (2/3) ... [2025-03-15 00:59:59,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66639870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:59:59, skipping insertion in model container [2025-03-15 00:59:59,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:59:59" (3/3) ... [2025-03-15 00:59:59,314 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1.wvr.c [2025-03-15 00:59:59,326 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:59:59,327 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-1.wvr.c that has 5 procedures, 364 locations, 1 initial locations, 5 loop locations, and 70 error locations. [2025-03-15 00:59:59,327 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:59:59,400 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-15 00:59:59,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:59:59,470 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;@74da4748, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:59:59,470 INFO L334 AbstractCegarLoop]: Starting to check reachability of 118 error locations. [2025-03-15 00:59:59,491 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:59:59,491 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-03-15 00:59:59,493 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:59:59,493 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:59,494 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] [2025-03-15 00:59:59,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2025-03-15 00:59:59,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:59,498 INFO L85 PathProgramCache]: Analyzing trace with hash 866260849, now seen corresponding path program 1 times [2025-03-15 00:59:59,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:59,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332898960] [2025-03-15 00:59:59,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:59,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:59,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:59,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:59,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332898960] [2025-03-15 00:59:59,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332898960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:59,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:59,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:59,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482900700] [2025-03-15 00:59:59,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:59,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:59,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:59,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:59,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:59,660 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 382 [2025-03-15 00:59:59,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 382 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:59,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:59,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 382 [2025-03-15 00:59:59,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:00,128 INFO L124 PetriNetUnfolderBase]: 476/1619 cut-off events. [2025-03-15 01:00:00,128 INFO L125 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2025-03-15 01:00:00,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2411 conditions, 1619 events. 476/1619 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9741 event pairs, 254 based on Foata normal form. 339/1809 useless extension candidates. Maximal degree in co-relation 1594. Up to 636 conditions per place. [2025-03-15 01:00:00,157 INFO L140 encePairwiseOnDemand]: 325/382 looper letters, 28 selfloop transitions, 2 changer transitions 17/317 dead transitions. [2025-03-15 01:00:00,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 317 transitions, 718 flow [2025-03-15 01:00:00,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:00,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions. [2025-03-15 01:00:00,174 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8490401396160558 [2025-03-15 01:00:00,176 INFO L298 CegarLoopForPetriNet]: 376 programPoint places, -54 predicate places. [2025-03-15 01:00:00,178 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 317 transitions, 718 flow [2025-03-15 01:00:00,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:00,178 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:00,178 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] [2025-03-15 01:00:00,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:00:00,179 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2025-03-15 01:00:00,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:00,180 INFO L85 PathProgramCache]: Analyzing trace with hash 2080806439, now seen corresponding path program 1 times [2025-03-15 01:00:00,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:00,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988096565] [2025-03-15 01:00:00,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:00,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:00,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:00,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988096565] [2025-03-15 01:00:00,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988096565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:00,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:00,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:00,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618885336] [2025-03-15 01:00:00,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:00,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:00,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:00,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:00,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:00,237 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 382 [2025-03-15 01:00:00,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 317 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:00,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:00,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 382 [2025-03-15 01:00:00,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:00,517 INFO L124 PetriNetUnfolderBase]: 476/1618 cut-off events. [2025-03-15 01:00:00,518 INFO L125 PetriNetUnfolderBase]: For 384/432 co-relation queries the response was YES. [2025-03-15 01:00:00,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3045 conditions, 1618 events. 476/1618 cut-off events. For 384/432 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9761 event pairs, 254 based on Foata normal form. 0/1470 useless extension candidates. Maximal degree in co-relation 2035. Up to 636 conditions per place. [2025-03-15 01:00:00,532 INFO L140 encePairwiseOnDemand]: 379/382 looper letters, 25 selfloop transitions, 2 changer transitions 17/316 dead transitions. [2025-03-15 01:00:00,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 316 transitions, 770 flow [2025-03-15 01:00:00,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:00,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2025-03-15 01:00:00,538 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8071553228621291 [2025-03-15 01:00:00,539 INFO L298 CegarLoopForPetriNet]: 376 programPoint places, -53 predicate places. [2025-03-15 01:00:00,539 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 316 transitions, 770 flow [2025-03-15 01:00:00,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:00,540 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:00,541 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] [2025-03-15 01:00:00,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:00:00,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2025-03-15 01:00:00,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:00,542 INFO L85 PathProgramCache]: Analyzing trace with hash 29097766, now seen corresponding path program 1 times [2025-03-15 01:00:00,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:00,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462911056] [2025-03-15 01:00:00,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:00,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:00,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:00,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:00,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462911056] [2025-03-15 01:00:00,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462911056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:00,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:00,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:00,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239157383] [2025-03-15 01:00:00,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:00,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:00,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:00,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:00,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:00,649 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 382 [2025-03-15 01:00:00,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 316 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:00,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:00,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 382 [2025-03-15 01:00:00,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:00,920 INFO L124 PetriNetUnfolderBase]: 476/1617 cut-off events. [2025-03-15 01:00:00,921 INFO L125 PetriNetUnfolderBase]: For 650/746 co-relation queries the response was YES. [2025-03-15 01:00:00,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3673 conditions, 1617 events. 476/1617 cut-off events. For 650/746 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9790 event pairs, 254 based on Foata normal form. 0/1470 useless extension candidates. Maximal degree in co-relation 2476. Up to 636 conditions per place. [2025-03-15 01:00:00,933 INFO L140 encePairwiseOnDemand]: 379/382 looper letters, 19 selfloop transitions, 2 changer transitions 17/315 dead transitions. [2025-03-15 01:00:00,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 315 transitions, 810 flow [2025-03-15 01:00:00,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2025-03-15 01:00:00,936 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8176265270506108 [2025-03-15 01:00:00,936 INFO L298 CegarLoopForPetriNet]: 376 programPoint places, -52 predicate places. [2025-03-15 01:00:00,936 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 315 transitions, 810 flow [2025-03-15 01:00:00,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:00,939 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:00,940 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] [2025-03-15 01:00:00,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:00:00,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2025-03-15 01:00:00,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:00,940 INFO L85 PathProgramCache]: Analyzing trace with hash 179224522, now seen corresponding path program 1 times [2025-03-15 01:00:00,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:00,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527609312] [2025-03-15 01:00:00,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:00,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:00,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:00,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527609312] [2025-03-15 01:00:00,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527609312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:00,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:00,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:00,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654177469] [2025-03-15 01:00:00,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:00,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:01,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:01,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:01,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:01,002 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 382 [2025-03-15 01:00:01,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 315 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:01,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:01,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 382 [2025-03-15 01:00:01,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:01,207 INFO L124 PetriNetUnfolderBase]: 476/1616 cut-off events. [2025-03-15 01:00:01,208 INFO L125 PetriNetUnfolderBase]: For 1040/1184 co-relation queries the response was YES. [2025-03-15 01:00:01,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4301 conditions, 1616 events. 476/1616 cut-off events. For 1040/1184 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9779 event pairs, 254 based on Foata normal form. 0/1470 useless extension candidates. Maximal degree in co-relation 2917. Up to 636 conditions per place. [2025-03-15 01:00:01,220 INFO L140 encePairwiseOnDemand]: 379/382 looper letters, 19 selfloop transitions, 2 changer transitions 17/314 dead transitions. [2025-03-15 01:00:01,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 314 transitions, 850 flow [2025-03-15 01:00:01,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:01,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:01,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2025-03-15 01:00:01,222 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8176265270506108 [2025-03-15 01:00:01,223 INFO L298 CegarLoopForPetriNet]: 376 programPoint places, -51 predicate places. [2025-03-15 01:00:01,223 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 314 transitions, 850 flow [2025-03-15 01:00:01,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:01,224 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:01,224 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] [2025-03-15 01:00:01,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:00:01,225 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2025-03-15 01:00:01,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:01,225 INFO L85 PathProgramCache]: Analyzing trace with hash -982188253, now seen corresponding path program 1 times [2025-03-15 01:00:01,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:01,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058496631] [2025-03-15 01:00:01,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:01,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:01,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:01,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058496631] [2025-03-15 01:00:01,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058496631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:01,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:01,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:01,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527916525] [2025-03-15 01:00:01,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:01,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:01,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:01,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:01,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:01,284 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 382 [2025-03-15 01:00:01,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 314 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:01,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:01,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 382 [2025-03-15 01:00:01,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:01,481 INFO L124 PetriNetUnfolderBase]: 476/1615 cut-off events. [2025-03-15 01:00:01,481 INFO L125 PetriNetUnfolderBase]: For 1554/1746 co-relation queries the response was YES. [2025-03-15 01:00:01,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4929 conditions, 1615 events. 476/1615 cut-off events. For 1554/1746 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9825 event pairs, 254 based on Foata normal form. 0/1470 useless extension candidates. Maximal degree in co-relation 3358. Up to 636 conditions per place. [2025-03-15 01:00:01,496 INFO L140 encePairwiseOnDemand]: 379/382 looper letters, 19 selfloop transitions, 2 changer transitions 17/313 dead transitions. [2025-03-15 01:00:01,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 313 transitions, 890 flow [2025-03-15 01:00:01,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:01,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:01,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2025-03-15 01:00:01,499 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8176265270506108 [2025-03-15 01:00:01,500 INFO L298 CegarLoopForPetriNet]: 376 programPoint places, -50 predicate places. [2025-03-15 01:00:01,500 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 313 transitions, 890 flow [2025-03-15 01:00:01,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:01,501 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:01,501 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:01,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:00:01,501 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2025-03-15 01:00:01,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:01,502 INFO L85 PathProgramCache]: Analyzing trace with hash -151772282, now seen corresponding path program 1 times [2025-03-15 01:00:01,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:01,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404187146] [2025-03-15 01:00:01,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:01,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:01,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:00:01,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:01,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404187146] [2025-03-15 01:00:01,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404187146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:01,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:01,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:01,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921195668] [2025-03-15 01:00:01,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:01,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:01,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:01,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:01,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:01,541 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 382 [2025-03-15 01:00:01,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 313 transitions, 890 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:01,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:01,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 382 [2025-03-15 01:00:01,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:01,784 INFO L124 PetriNetUnfolderBase]: 476/1614 cut-off events. [2025-03-15 01:00:01,784 INFO L125 PetriNetUnfolderBase]: For 2192/2432 co-relation queries the response was YES. [2025-03-15 01:00:01,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5557 conditions, 1614 events. 476/1614 cut-off events. For 2192/2432 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9785 event pairs, 254 based on Foata normal form. 0/1470 useless extension candidates. Maximal degree in co-relation 3799. Up to 636 conditions per place. [2025-03-15 01:00:01,797 INFO L140 encePairwiseOnDemand]: 379/382 looper letters, 19 selfloop transitions, 2 changer transitions 17/312 dead transitions. [2025-03-15 01:00:01,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 312 transitions, 930 flow [2025-03-15 01:00:01,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:01,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2025-03-15 01:00:01,799 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8176265270506108 [2025-03-15 01:00:01,800 INFO L298 CegarLoopForPetriNet]: 376 programPoint places, -49 predicate places. [2025-03-15 01:00:01,800 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 312 transitions, 930 flow [2025-03-15 01:00:01,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:01,801 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:01,801 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] [2025-03-15 01:00:01,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:00:01,801 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2025-03-15 01:00:01,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:01,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1999480407, now seen corresponding path program 1 times [2025-03-15 01:00:01,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:01,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185183270] [2025-03-15 01:00:01,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:01,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:01,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:01,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185183270] [2025-03-15 01:00:01,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185183270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:01,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:01,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:01,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129260882] [2025-03-15 01:00:01,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:01,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:01,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:01,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:01,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:01,862 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 382 [2025-03-15 01:00:01,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 312 transitions, 930 flow. Second operand has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:01,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:01,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 382 [2025-03-15 01:00:01,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:02,130 INFO L124 PetriNetUnfolderBase]: 476/1613 cut-off events. [2025-03-15 01:00:02,130 INFO L125 PetriNetUnfolderBase]: For 2954/3242 co-relation queries the response was YES. [2025-03-15 01:00:02,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6200 conditions, 1613 events. 476/1613 cut-off events. For 2954/3242 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9827 event pairs, 254 based on Foata normal form. 0/1470 useless extension candidates. Maximal degree in co-relation 4240. Up to 642 conditions per place. [2025-03-15 01:00:02,150 INFO L140 encePairwiseOnDemand]: 379/382 looper letters, 34 selfloop transitions, 2 changer transitions 17/311 dead transitions. [2025-03-15 01:00:02,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 311 transitions, 1000 flow [2025-03-15 01:00:02,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:02,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 907 transitions. [2025-03-15 01:00:02,153 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7914485165794066 [2025-03-15 01:00:02,154 INFO L298 CegarLoopForPetriNet]: 376 programPoint places, -48 predicate places. [2025-03-15 01:00:02,154 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 311 transitions, 1000 flow [2025-03-15 01:00:02,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:02,155 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:02,155 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] [2025-03-15 01:00:02,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:00:02,156 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2025-03-15 01:00:02,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:02,157 INFO L85 PathProgramCache]: Analyzing trace with hash 647442584, now seen corresponding path program 1 times [2025-03-15 01:00:02,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:02,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771052822] [2025-03-15 01:00:02,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:02,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:02,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:02,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:02,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771052822] [2025-03-15 01:00:02,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771052822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:02,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:02,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:02,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628483963] [2025-03-15 01:00:02,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:02,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:02,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:02,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:02,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:02,207 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 382 [2025-03-15 01:00:02,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 311 transitions, 1000 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:02,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:02,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 382 [2025-03-15 01:00:02,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:02,508 INFO L124 PetriNetUnfolderBase]: 476/1612 cut-off events. [2025-03-15 01:00:02,508 INFO L125 PetriNetUnfolderBase]: For 3840/4176 co-relation queries the response was YES. [2025-03-15 01:00:02,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6834 conditions, 1612 events. 476/1612 cut-off events. For 3840/4176 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9781 event pairs, 254 based on Foata normal form. 0/1470 useless extension candidates. Maximal degree in co-relation 4681. Up to 642 conditions per place. [2025-03-15 01:00:02,530 INFO L140 encePairwiseOnDemand]: 379/382 looper letters, 24 selfloop transitions, 2 changer transitions 17/310 dead transitions. [2025-03-15 01:00:02,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 310 transitions, 1052 flow [2025-03-15 01:00:02,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2025-03-15 01:00:02,533 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8071553228621291 [2025-03-15 01:00:02,535 INFO L298 CegarLoopForPetriNet]: 376 programPoint places, -47 predicate places. [2025-03-15 01:00:02,535 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 310 transitions, 1052 flow [2025-03-15 01:00:02,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:02,535 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:02,536 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] [2025-03-15 01:00:02,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:00:02,536 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2025-03-15 01:00:02,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:02,537 INFO L85 PathProgramCache]: Analyzing trace with hash 391444109, now seen corresponding path program 1 times [2025-03-15 01:00:02,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:02,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033098439] [2025-03-15 01:00:02,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:02,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:02,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:02,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033098439] [2025-03-15 01:00:02,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033098439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:02,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:02,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:02,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182052229] [2025-03-15 01:00:02,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:02,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:02,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:02,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:02,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:02,597 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 382 [2025-03-15 01:00:02,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 310 transitions, 1052 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:02,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:02,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 382 [2025-03-15 01:00:02,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:02,850 INFO L124 PetriNetUnfolderBase]: 476/1611 cut-off events. [2025-03-15 01:00:02,850 INFO L125 PetriNetUnfolderBase]: For 4850/5234 co-relation queries the response was YES. [2025-03-15 01:00:02,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7471 conditions, 1611 events. 476/1611 cut-off events. For 4850/5234 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9735 event pairs, 254 based on Foata normal form. 0/1470 useless extension candidates. Maximal degree in co-relation 5122. Up to 642 conditions per place. [2025-03-15 01:00:02,865 INFO L140 encePairwiseOnDemand]: 379/382 looper letters, 28 selfloop transitions, 2 changer transitions 17/309 dead transitions. [2025-03-15 01:00:02,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 309 transitions, 1110 flow [2025-03-15 01:00:02,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:02,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:02,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 919 transitions. [2025-03-15 01:00:02,868 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8019197207678883 [2025-03-15 01:00:02,869 INFO L298 CegarLoopForPetriNet]: 376 programPoint places, -46 predicate places. [2025-03-15 01:00:02,869 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 309 transitions, 1110 flow [2025-03-15 01:00:02,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:02,869 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:02,869 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:00:02,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:00:02,869 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2025-03-15 01:00:02,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:02,870 INFO L85 PathProgramCache]: Analyzing trace with hash -502158173, now seen corresponding path program 1 times [2025-03-15 01:00:02,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:02,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844672333] [2025-03-15 01:00:02,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:02,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:02,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:02,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844672333] [2025-03-15 01:00:02,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844672333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:02,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:02,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:02,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036500798] [2025-03-15 01:00:02,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:02,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:02,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:02,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:02,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:02,909 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 382 [2025-03-15 01:00:02,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 309 transitions, 1110 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:02,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:02,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 382 [2025-03-15 01:00:02,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:03,103 INFO L124 PetriNetUnfolderBase]: 476/1608 cut-off events. [2025-03-15 01:00:03,104 INFO L125 PetriNetUnfolderBase]: For 5977/6409 co-relation queries the response was YES. [2025-03-15 01:00:03,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8097 conditions, 1608 events. 476/1608 cut-off events. For 5977/6409 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9809 event pairs, 254 based on Foata normal form. 0/1470 useless extension candidates. Maximal degree in co-relation 5563. Up to 642 conditions per place. [2025-03-15 01:00:03,124 INFO L140 encePairwiseOnDemand]: 378/382 looper letters, 23 selfloop transitions, 1 changer transitions 17/306 dead transitions. [2025-03-15 01:00:03,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 306 transitions, 1146 flow [2025-03-15 01:00:03,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 927 transitions. [2025-03-15 01:00:03,127 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8089005235602095 [2025-03-15 01:00:03,128 INFO L298 CegarLoopForPetriNet]: 376 programPoint places, -47 predicate places. [2025-03-15 01:00:03,128 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 306 transitions, 1146 flow [2025-03-15 01:00:03,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:03,129 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:03,129 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:00:03,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:00:03,129 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2025-03-15 01:00:03,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:03,130 INFO L85 PathProgramCache]: Analyzing trace with hash 617240253, now seen corresponding path program 1 times [2025-03-15 01:00:03,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:03,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137995967] [2025-03-15 01:00:03,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:03,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:03,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:03,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:03,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137995967] [2025-03-15 01:00:03,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137995967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:03,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:03,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:03,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504597077] [2025-03-15 01:00:03,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:03,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:03,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:03,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:03,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:03,195 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 382 [2025-03-15 01:00:03,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 306 transitions, 1146 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:03,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:03,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 382 [2025-03-15 01:00:03,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:03,410 INFO L124 PetriNetUnfolderBase]: 476/1607 cut-off events. [2025-03-15 01:00:03,411 INFO L125 PetriNetUnfolderBase]: For 7234/7714 co-relation queries the response was YES. [2025-03-15 01:00:03,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8725 conditions, 1607 events. 476/1607 cut-off events. For 7234/7714 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9799 event pairs, 254 based on Foata normal form. 0/1470 useless extension candidates. Maximal degree in co-relation 6004. Up to 642 conditions per place. [2025-03-15 01:00:03,430 INFO L140 encePairwiseOnDemand]: 379/382 looper letters, 19 selfloop transitions, 2 changer transitions 17/305 dead transitions. [2025-03-15 01:00:03,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 305 transitions, 1186 flow [2025-03-15 01:00:03,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:03,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2025-03-15 01:00:03,432 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8176265270506108 [2025-03-15 01:00:03,432 INFO L298 CegarLoopForPetriNet]: 376 programPoint places, -46 predicate places. [2025-03-15 01:00:03,432 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 305 transitions, 1186 flow [2025-03-15 01:00:03,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:03,433 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:03,433 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:00:03,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:00:03,433 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2025-03-15 01:00:03,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:03,434 INFO L85 PathProgramCache]: Analyzing trace with hash 906742751, now seen corresponding path program 1 times [2025-03-15 01:00:03,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:03,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425377655] [2025-03-15 01:00:03,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:03,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:03,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:00:03,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:03,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425377655] [2025-03-15 01:00:03,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425377655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:03,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:03,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:00:03,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363733703] [2025-03-15 01:00:03,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:03,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:00:03,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:03,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:00:03,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:00:03,893 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 382 [2025-03-15 01:00:03,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 305 transitions, 1186 flow. Second operand has 6 states, 6 states have (on average 294.8333333333333) internal successors, (1769), 6 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:03,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:03,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 382 [2025-03-15 01:00:03,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:04,144 INFO L124 PetriNetUnfolderBase]: 476/1606 cut-off events. [2025-03-15 01:00:04,144 INFO L125 PetriNetUnfolderBase]: For 8605/9133 co-relation queries the response was YES. [2025-03-15 01:00:04,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9366 conditions, 1606 events. 476/1606 cut-off events. For 8605/9133 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9811 event pairs, 254 based on Foata normal form. 0/1470 useless extension candidates. Maximal degree in co-relation 6445. Up to 642 conditions per place. [2025-03-15 01:00:04,162 INFO L140 encePairwiseOnDemand]: 376/382 looper letters, 29 selfloop transitions, 5 changer transitions 17/304 dead transitions. [2025-03-15 01:00:04,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 304 transitions, 1252 flow [2025-03-15 01:00:04,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:00:04,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:00:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1793 transitions. [2025-03-15 01:00:04,165 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7822862129144852 [2025-03-15 01:00:04,166 INFO L298 CegarLoopForPetriNet]: 376 programPoint places, -42 predicate places. [2025-03-15 01:00:04,166 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 304 transitions, 1252 flow [2025-03-15 01:00:04,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 294.8333333333333) internal successors, (1769), 6 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:04,167 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:04,167 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] [2025-03-15 01:00:04,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:00:04,167 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2025-03-15 01:00:04,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:04,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2027726769, now seen corresponding path program 1 times [2025-03-15 01:00:04,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:04,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613236044] [2025-03-15 01:00:04,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:04,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:04,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:04,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:04,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613236044] [2025-03-15 01:00:04,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613236044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:04,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:04,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:04,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521445643] [2025-03-15 01:00:04,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:04,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:04,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:04,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:04,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:04,200 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 382 [2025-03-15 01:00:04,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 304 transitions, 1252 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:04,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:04,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 382 [2025-03-15 01:00:04,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:04,560 INFO L124 PetriNetUnfolderBase]: 668/2086 cut-off events. [2025-03-15 01:00:04,561 INFO L125 PetriNetUnfolderBase]: For 18274/20986 co-relation queries the response was YES. [2025-03-15 01:00:04,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13982 conditions, 2086 events. 668/2086 cut-off events. For 18274/20986 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 14035 event pairs, 115 based on Foata normal form. 0/1903 useless extension candidates. Maximal degree in co-relation 9352. Up to 906 conditions per place. [2025-03-15 01:00:04,593 INFO L140 encePairwiseOnDemand]: 373/382 looper letters, 40 selfloop transitions, 4 changer transitions 17/315 dead transitions. [2025-03-15 01:00:04,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 315 transitions, 1735 flow [2025-03-15 01:00:04,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:04,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 931 transitions. [2025-03-15 01:00:04,596 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.81239092495637 [2025-03-15 01:00:04,597 INFO L298 CegarLoopForPetriNet]: 376 programPoint places, -45 predicate places. [2025-03-15 01:00:04,597 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 315 transitions, 1735 flow [2025-03-15 01:00:04,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:04,598 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:04,598 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] [2025-03-15 01:00:04,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:00:04,598 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2025-03-15 01:00:04,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:04,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1269684004, now seen corresponding path program 1 times [2025-03-15 01:00:04,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:04,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384260192] [2025-03-15 01:00:04,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:04,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:04,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:04,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384260192] [2025-03-15 01:00:04,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384260192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:04,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:04,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:04,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009505632] [2025-03-15 01:00:04,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:04,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:04,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:04,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:04,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:04,640 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 382 [2025-03-15 01:00:04,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 315 transitions, 1735 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:04,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:04,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 382 [2025-03-15 01:00:04,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:05,079 INFO L124 PetriNetUnfolderBase]: 897/2792 cut-off events. [2025-03-15 01:00:05,079 INFO L125 PetriNetUnfolderBase]: For 27179/31755 co-relation queries the response was YES. [2025-03-15 01:00:05,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19933 conditions, 2792 events. 897/2792 cut-off events. For 27179/31755 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 20363 event pairs, 51 based on Foata normal form. 0/2541 useless extension candidates. Maximal degree in co-relation 13264. Up to 1222 conditions per place. [2025-03-15 01:00:05,114 INFO L140 encePairwiseOnDemand]: 376/382 looper letters, 56 selfloop transitions, 5 changer transitions 29/340 dead transitions. [2025-03-15 01:00:05,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 340 transitions, 2617 flow [2025-03-15 01:00:05,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:05,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 947 transitions. [2025-03-15 01:00:05,118 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8263525305410122 [2025-03-15 01:00:05,119 INFO L298 CegarLoopForPetriNet]: 376 programPoint places, -45 predicate places. [2025-03-15 01:00:05,119 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 340 transitions, 2617 flow [2025-03-15 01:00:05,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:05,119 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:05,119 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] [2025-03-15 01:00:05,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:00:05,119 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2025-03-15 01:00:05,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1882607326, now seen corresponding path program 1 times [2025-03-15 01:00:05,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:05,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226393660] [2025-03-15 01:00:05,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:05,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:05,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:05,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:05,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226393660] [2025-03-15 01:00:05,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226393660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:05,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:05,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:05,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773247549] [2025-03-15 01:00:05,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:05,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:05,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:05,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:05,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:05,169 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 382 [2025-03-15 01:00:05,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 340 transitions, 2617 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:05,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:05,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 382 [2025-03-15 01:00:05,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:05,605 INFO L124 PetriNetUnfolderBase]: 1020/3132 cut-off events. [2025-03-15 01:00:05,605 INFO L125 PetriNetUnfolderBase]: For 33840/38740 co-relation queries the response was YES. [2025-03-15 01:00:05,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24074 conditions, 3132 events. 1020/3132 cut-off events. For 33840/38740 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 23680 event pairs, 22 based on Foata normal form. 0/2864 useless extension candidates. Maximal degree in co-relation 19243. Up to 1384 conditions per place. [2025-03-15 01:00:05,647 INFO L140 encePairwiseOnDemand]: 375/382 looper letters, 83 selfloop transitions, 6 changer transitions 33/363 dead transitions. [2025-03-15 01:00:05,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 363 transitions, 3580 flow [2025-03-15 01:00:05,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 942 transitions. [2025-03-15 01:00:05,649 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8219895287958116 [2025-03-15 01:00:05,649 INFO L298 CegarLoopForPetriNet]: 376 programPoint places, -46 predicate places. [2025-03-15 01:00:05,649 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 363 transitions, 3580 flow [2025-03-15 01:00:05,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:05,650 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:05,650 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] [2025-03-15 01:00:05,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:00:05,650 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 114 more)] === [2025-03-15 01:00:05,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:05,651 INFO L85 PathProgramCache]: Analyzing trace with hash -72800113, now seen corresponding path program 1 times [2025-03-15 01:00:05,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:05,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566115535] [2025-03-15 01:00:05,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:05,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:05,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:00:05,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:05,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566115535] [2025-03-15 01:00:05,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566115535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:05,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:05,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:05,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414657355] [2025-03-15 01:00:05,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:05,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:05,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:05,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:05,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:05,686 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 382 [2025-03-15 01:00:05,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 363 transitions, 3580 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:05,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:05,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 382 [2025-03-15 01:00:05,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:06,204 INFO L124 PetriNetUnfolderBase]: 1164/3429 cut-off events. [2025-03-15 01:00:06,204 INFO L125 PetriNetUnfolderBase]: For 30957/31947 co-relation queries the response was YES. [2025-03-15 01:00:06,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29046 conditions, 3429 events. 1164/3429 cut-off events. For 30957/31947 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 25343 event pairs, 0 based on Foata normal form. 0/3193 useless extension candidates. Maximal degree in co-relation 20175. Up to 1589 conditions per place. [2025-03-15 01:00:06,224 INFO L140 encePairwiseOnDemand]: 376/382 looper letters, 0 selfloop transitions, 0 changer transitions 401/401 dead transitions. [2025-03-15 01:00:06,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 401 transitions, 5149 flow [2025-03-15 01:00:06,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:06,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 948 transitions. [2025-03-15 01:00:06,226 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8272251308900523 [2025-03-15 01:00:06,227 INFO L298 CegarLoopForPetriNet]: 376 programPoint places, -46 predicate places. [2025-03-15 01:00:06,227 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 401 transitions, 5149 flow [2025-03-15 01:00:06,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:06,234 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-parallel-sum-1.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 01:00:06,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (117 of 118 remaining) [2025-03-15 01:00:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (116 of 118 remaining) [2025-03-15 01:00:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (115 of 118 remaining) [2025-03-15 01:00:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (114 of 118 remaining) [2025-03-15 01:00:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (113 of 118 remaining) [2025-03-15 01:00:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (112 of 118 remaining) [2025-03-15 01:00:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (111 of 118 remaining) [2025-03-15 01:00:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (110 of 118 remaining) [2025-03-15 01:00:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (109 of 118 remaining) [2025-03-15 01:00:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (108 of 118 remaining) [2025-03-15 01:00:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (107 of 118 remaining) [2025-03-15 01:00:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (106 of 118 remaining) [2025-03-15 01:00:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (105 of 118 remaining) [2025-03-15 01:00:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (104 of 118 remaining) [2025-03-15 01:00:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (103 of 118 remaining) [2025-03-15 01:00:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (102 of 118 remaining) [2025-03-15 01:00:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (101 of 118 remaining) [2025-03-15 01:00:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (100 of 118 remaining) [2025-03-15 01:00:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (99 of 118 remaining) [2025-03-15 01:00:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (98 of 118 remaining) [2025-03-15 01:00:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (97 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (96 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (95 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (94 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (93 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (92 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (91 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (90 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (89 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (88 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (87 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (86 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (85 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (84 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (83 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (82 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (81 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (80 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (79 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (78 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (77 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (76 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (75 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (74 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (73 of 118 remaining) [2025-03-15 01:00:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (72 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (71 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (70 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (69 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (68 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (67 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (66 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (65 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (64 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (63 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (62 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (61 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (60 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (59 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (58 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (54 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (53 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (52 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (51 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (50 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (49 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (48 of 118 remaining) [2025-03-15 01:00:06,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (47 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (46 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (45 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (44 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (43 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (42 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (41 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (40 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (39 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (38 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (37 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (36 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (35 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (34 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (33 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (32 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (31 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (30 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (29 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (28 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (27 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (26 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (25 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (24 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (23 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (22 of 118 remaining) [2025-03-15 01:00:06,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (21 of 118 remaining) [2025-03-15 01:00:06,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (20 of 118 remaining) [2025-03-15 01:00:06,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (19 of 118 remaining) [2025-03-15 01:00:06,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (18 of 118 remaining) [2025-03-15 01:00:06,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (17 of 118 remaining) [2025-03-15 01:00:06,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (16 of 118 remaining) [2025-03-15 01:00:06,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (15 of 118 remaining) [2025-03-15 01:00:06,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (14 of 118 remaining) [2025-03-15 01:00:06,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (13 of 118 remaining) [2025-03-15 01:00:06,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (12 of 118 remaining) [2025-03-15 01:00:06,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (11 of 118 remaining) [2025-03-15 01:00:06,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (10 of 118 remaining) [2025-03-15 01:00:06,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (9 of 118 remaining) [2025-03-15 01:00:06,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (8 of 118 remaining) [2025-03-15 01:00:06,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (7 of 118 remaining) [2025-03-15 01:00:06,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (6 of 118 remaining) [2025-03-15 01:00:06,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (5 of 118 remaining) [2025-03-15 01:00:06,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (4 of 118 remaining) [2025-03-15 01:00:06,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (3 of 118 remaining) [2025-03-15 01:00:06,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (2 of 118 remaining) [2025-03-15 01:00:06,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (1 of 118 remaining) [2025-03-15 01:00:06,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (0 of 118 remaining) [2025-03-15 01:00:06,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:00:06,271 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:06,274 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:00:06,275 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:00:06,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:00:06 BasicIcfg [2025-03-15 01:00:06,278 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:00:06,279 INFO L158 Benchmark]: Toolchain (without parser) took 8295.26ms. Allocated memory was 71.3MB in the beginning and 687.9MB in the end (delta: 616.6MB). Free memory was 43.8MB in the beginning and 362.0MB in the end (delta: -318.2MB). Peak memory consumption was 475.9MB. Max. memory is 8.0GB. [2025-03-15 01:00:06,279 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 71.3MB. Free memory was 34.0MB in the beginning and 33.9MB in the end (delta: 42.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:00:06,279 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.25ms. Allocated memory is still 71.3MB. Free memory was 43.6MB in the beginning and 30.0MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 01:00:06,279 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.49ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 26.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:00:06,279 INFO L158 Benchmark]: Boogie Preprocessor took 44.66ms. Allocated memory is still 71.3MB. Free memory was 26.7MB in the beginning and 24.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:00:06,279 INFO L158 Benchmark]: RCFGBuilder took 997.34ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 24.1MB in the beginning and 41.2MB in the end (delta: -17.2MB). Peak memory consumption was 24.2MB. Max. memory is 8.0GB. [2025-03-15 01:00:06,279 INFO L158 Benchmark]: TraceAbstraction took 6970.22ms. Allocated memory was 88.1MB in the beginning and 687.9MB in the end (delta: 599.8MB). Free memory was 40.1MB in the beginning and 362.0MB in the end (delta: -321.9MB). Peak memory consumption was 456.0MB. Max. memory is 8.0GB. [2025-03-15 01:00:06,280 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 71.3MB. Free memory was 34.0MB in the beginning and 33.9MB in the end (delta: 42.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.25ms. Allocated memory is still 71.3MB. Free memory was 43.6MB in the beginning and 30.0MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.49ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 26.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 44.66ms. Allocated memory is still 71.3MB. Free memory was 26.7MB in the beginning and 24.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 997.34ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 24.1MB in the beginning and 41.2MB in the end (delta: -17.2MB). Peak memory consumption was 24.2MB. Max. memory is 8.0GB. * TraceAbstraction took 6970.22ms. Allocated memory was 88.1MB in the beginning and 687.9MB in the end (delta: 599.8MB). Free memory was 40.1MB in the beginning and 362.0MB in the end (delta: -321.9MB). Peak memory consumption was 456.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: 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: 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: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: 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: 111]: 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: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: 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: 124]: 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: 124]: 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: 124]: 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: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: 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, 456 locations, 118 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: 6.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 674 IncrementalHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 126 mSDtfsCounter, 674 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5149occurred in iteration=16, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1476 NumberOfCodeBlocks, 1476 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1460 ConstructedInterpolants, 0 QuantifiedInterpolants, 1605 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 70 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:00:06,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...