/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/goblint-regression/04-mutex_43-thread_create_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:25:25,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:25:25,624 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:25:25,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:25:25,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:25:25,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:25:25,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:25:25,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:25:25,674 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:25:25,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:25:25,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:25:25,674 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:25:25,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:25:25,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:25:25,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:25:25,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:25:25,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:25:25,675 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:25:25,676 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:25:25,676 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:25:25,676 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:25:25,676 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:25:25,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:25:25,676 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:25:25,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:25:25,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:25:25,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:25:25,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:25:25,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:25:25,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:25:25,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:25:25,677 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:25:25,677 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:25:25,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:25:25,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:25:25,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:25:25,956 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:25:25,956 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:25:25,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_43-thread_create_nr.i [2025-03-15 00:25:27,152 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b767e80ce/fbf2e2cdea48459ea1626b6ba4d2ef26/FLAG11ef5122c [2025-03-15 00:25:27,383 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:25:27,388 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_43-thread_create_nr.i [2025-03-15 00:25:27,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b767e80ce/fbf2e2cdea48459ea1626b6ba4d2ef26/FLAG11ef5122c [2025-03-15 00:25:27,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b767e80ce/fbf2e2cdea48459ea1626b6ba4d2ef26 [2025-03-15 00:25:27,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:25:27,423 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:25:27,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:25:27,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:25:27,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:25:27,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:25:27" (1/1) ... [2025-03-15 00:25:27,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711e2ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:27, skipping insertion in model container [2025-03-15 00:25:27,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:25:27" (1/1) ... [2025-03-15 00:25:27,461 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:25:27,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:25:27,780 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:25:27,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:25:27,905 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:25:27,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:27 WrapperNode [2025-03-15 00:25:27,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:25:27,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:25:27,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:25:27,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:25:27,914 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:25:27" (1/1) ... [2025-03-15 00:25:27,927 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:25:27" (1/1) ... [2025-03-15 00:25:27,949 INFO L138 Inliner]: procedures = 262, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 98 [2025-03-15 00:25:27,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:25:27,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:25:27,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:25:27,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:25:27,957 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:27" (1/1) ... [2025-03-15 00:25:27,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:27" (1/1) ... [2025-03-15 00:25:27,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:27" (1/1) ... [2025-03-15 00:25:27,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:27" (1/1) ... [2025-03-15 00:25:27,968 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:27" (1/1) ... [2025-03-15 00:25:27,969 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:27" (1/1) ... [2025-03-15 00:25:27,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:27" (1/1) ... [2025-03-15 00:25:27,974 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:27" (1/1) ... [2025-03-15 00:25:27,975 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:27" (1/1) ... [2025-03-15 00:25:27,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:25:27,977 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:25:27,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:25:27,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:25:27,977 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:27" (1/1) ... [2025-03-15 00:25:27,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:25:27,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:25:28,006 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:25:28,011 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:25:28,026 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:25:28,027 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:25:28,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:25:28,027 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 00:25:28,027 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 00:25:28,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:25:28,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:25:28,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:25:28,028 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:25:28,117 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:25:28,118 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:25:28,264 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:25:28,264 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:25:28,275 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:25:28,275 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:25:28,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:25:28 BoogieIcfgContainer [2025-03-15 00:25:28,275 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:25:28,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:25:28,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:25:28,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:25:28,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:25:27" (1/3) ... [2025-03-15 00:25:28,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bfb6062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:25:28, skipping insertion in model container [2025-03-15 00:25:28,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:27" (2/3) ... [2025-03-15 00:25:28,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bfb6062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:25:28, skipping insertion in model container [2025-03-15 00:25:28,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:25:28" (3/3) ... [2025-03-15 00:25:28,283 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_43-thread_create_nr.i [2025-03-15 00:25:28,294 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:25:28,295 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_43-thread_create_nr.i that has 2 procedures, 125 locations, 1 initial locations, 0 loop locations, and 7 error locations. [2025-03-15 00:25:28,295 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:25:28,355 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 00:25:28,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:25:28,392 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;@46aeff07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:25:28,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-15 00:25:28,429 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:25:28,430 INFO L124 PetriNetUnfolderBase]: 0/74 cut-off events. [2025-03-15 00:25:28,431 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:25:28,431 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:28,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] [2025-03-15 00:25:28,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-15 00:25:28,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:28,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1060240128, now seen corresponding path program 1 times [2025-03-15 00:25:28,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:28,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691028547] [2025-03-15 00:25:28,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:28,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:28,665 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:25:28,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:28,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691028547] [2025-03-15 00:25:28,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691028547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:28,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:28,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:25:28,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626617391] [2025-03-15 00:25:28,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:28,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:25:28,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:28,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:25:28,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:25:28,711 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 124 [2025-03-15 00:25:28,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 124 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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:25:28,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:28,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 124 [2025-03-15 00:25:28,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:28,781 INFO L124 PetriNetUnfolderBase]: 14/179 cut-off events. [2025-03-15 00:25:28,781 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 00:25:28,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 179 events. 14/179 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 319 event pairs, 14 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 127. Up to 42 conditions per place. [2025-03-15 00:25:28,786 INFO L140 encePairwiseOnDemand]: 121/124 looper letters, 13 selfloop transitions, 2 changer transitions 0/122 dead transitions. [2025-03-15 00:25:28,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 122 transitions, 277 flow [2025-03-15 00:25:28,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:25:28,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:25:28,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2025-03-15 00:25:28,797 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9139784946236559 [2025-03-15 00:25:28,799 INFO L298 CegarLoopForPetriNet]: 128 programPoint places, 0 predicate places. [2025-03-15 00:25:28,800 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 122 transitions, 277 flow [2025-03-15 00:25:28,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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:25:28,801 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:28,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, 1, 1] [2025-03-15 00:25:28,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:25:28,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-15 00:25:28,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:28,802 INFO L85 PathProgramCache]: Analyzing trace with hash -423887029, now seen corresponding path program 1 times [2025-03-15 00:25:28,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:28,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459868698] [2025-03-15 00:25:28,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:28,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:28,893 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:25:28,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:28,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459868698] [2025-03-15 00:25:28,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459868698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:28,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:28,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:25:28,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64821779] [2025-03-15 00:25:28,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:28,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:25:28,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:28,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:25:28,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:25:28,897 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 124 [2025-03-15 00:25:28,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 122 transitions, 277 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:25:28,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:28,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 124 [2025-03-15 00:25:28,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:28,957 INFO L124 PetriNetUnfolderBase]: 14/176 cut-off events. [2025-03-15 00:25:28,957 INFO L125 PetriNetUnfolderBase]: For 19/24 co-relation queries the response was YES. [2025-03-15 00:25:28,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 176 events. 14/176 cut-off events. For 19/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 310 event pairs, 14 based on Foata normal form. 1/163 useless extension candidates. Maximal degree in co-relation 151. Up to 42 conditions per place. [2025-03-15 00:25:28,958 INFO L140 encePairwiseOnDemand]: 118/124 looper letters, 9 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2025-03-15 00:25:28,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 120 transitions, 299 flow [2025-03-15 00:25:28,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:25:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:25:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2025-03-15 00:25:28,962 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9193548387096774 [2025-03-15 00:25:28,962 INFO L298 CegarLoopForPetriNet]: 128 programPoint places, 0 predicate places. [2025-03-15 00:25:28,962 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 120 transitions, 299 flow [2025-03-15 00:25:28,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:25:28,963 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:28,963 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] [2025-03-15 00:25:28,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:25:28,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-15 00:25:28,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:28,965 INFO L85 PathProgramCache]: Analyzing trace with hash 524466032, now seen corresponding path program 1 times [2025-03-15 00:25:28,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:28,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240372016] [2025-03-15 00:25:28,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:28,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:29,038 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:25:29,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:29,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240372016] [2025-03-15 00:25:29,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240372016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:29,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:29,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:25:29,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248744579] [2025-03-15 00:25:29,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:29,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:25:29,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:29,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:25:29,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:25:29,040 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 124 [2025-03-15 00:25:29,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 120 transitions, 299 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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:25:29,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:29,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 124 [2025-03-15 00:25:29,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:29,092 INFO L124 PetriNetUnfolderBase]: 19/188 cut-off events. [2025-03-15 00:25:29,093 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-03-15 00:25:29,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 188 events. 19/188 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 391 event pairs, 19 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 213. Up to 47 conditions per place. [2025-03-15 00:25:29,094 INFO L140 encePairwiseOnDemand]: 121/124 looper letters, 14 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2025-03-15 00:25:29,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 119 transitions, 327 flow [2025-03-15 00:25:29,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:25:29,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:25:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2025-03-15 00:25:29,095 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8924731182795699 [2025-03-15 00:25:29,096 INFO L298 CegarLoopForPetriNet]: 128 programPoint places, 1 predicate places. [2025-03-15 00:25:29,096 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 119 transitions, 327 flow [2025-03-15 00:25:29,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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:25:29,096 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:29,096 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] [2025-03-15 00:25:29,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:25:29,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-15 00:25:29,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:29,097 INFO L85 PathProgramCache]: Analyzing trace with hash -362410013, now seen corresponding path program 1 times [2025-03-15 00:25:29,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:29,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158663902] [2025-03-15 00:25:29,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:29,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:29,172 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:25:29,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:29,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158663902] [2025-03-15 00:25:29,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158663902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:29,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:29,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:25:29,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125965223] [2025-03-15 00:25:29,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:29,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:25:29,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:29,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:25:29,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:25:29,175 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 124 [2025-03-15 00:25:29,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 119 transitions, 327 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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:25:29,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:29,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 124 [2025-03-15 00:25:29,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:29,214 INFO L124 PetriNetUnfolderBase]: 17/183 cut-off events. [2025-03-15 00:25:29,215 INFO L125 PetriNetUnfolderBase]: For 96/114 co-relation queries the response was YES. [2025-03-15 00:25:29,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 183 events. 17/183 cut-off events. For 96/114 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 313 event pairs, 13 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 228. Up to 44 conditions per place. [2025-03-15 00:25:29,217 INFO L140 encePairwiseOnDemand]: 121/124 looper letters, 10 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2025-03-15 00:25:29,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 120 transitions, 363 flow [2025-03-15 00:25:29,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:25:29,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:25:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2025-03-15 00:25:29,218 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9381720430107527 [2025-03-15 00:25:29,220 INFO L298 CegarLoopForPetriNet]: 128 programPoint places, 2 predicate places. [2025-03-15 00:25:29,220 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 120 transitions, 363 flow [2025-03-15 00:25:29,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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:25:29,220 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:29,221 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:25:29,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:25:29,221 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-15 00:25:29,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:29,223 INFO L85 PathProgramCache]: Analyzing trace with hash -820289549, now seen corresponding path program 1 times [2025-03-15 00:25:29,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:29,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79278702] [2025-03-15 00:25:29,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:29,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:29,316 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:25:29,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:29,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79278702] [2025-03-15 00:25:29,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79278702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:29,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:29,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:25:29,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510896036] [2025-03-15 00:25:29,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:29,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:25:29,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:29,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:25:29,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:25:29,318 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 124 [2025-03-15 00:25:29,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 120 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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:25:29,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:29,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 124 [2025-03-15 00:25:29,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:29,358 INFO L124 PetriNetUnfolderBase]: 19/180 cut-off events. [2025-03-15 00:25:29,359 INFO L125 PetriNetUnfolderBase]: For 177/234 co-relation queries the response was YES. [2025-03-15 00:25:29,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 180 events. 19/180 cut-off events. For 177/234 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 328 event pairs, 9 based on Foata normal form. 1/175 useless extension candidates. Maximal degree in co-relation 269. Up to 46 conditions per place. [2025-03-15 00:25:29,361 INFO L140 encePairwiseOnDemand]: 121/124 looper letters, 12 selfloop transitions, 2 changer transitions 6/121 dead transitions. [2025-03-15 00:25:29,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 121 transitions, 411 flow [2025-03-15 00:25:29,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:25:29,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:25:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2025-03-15 00:25:29,365 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9139784946236559 [2025-03-15 00:25:29,366 INFO L298 CegarLoopForPetriNet]: 128 programPoint places, 3 predicate places. [2025-03-15 00:25:29,366 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 121 transitions, 411 flow [2025-03-15 00:25:29,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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:25:29,366 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:29,366 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 00:25:29,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:25:29,366 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-15 00:25:29,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:29,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1193191267, now seen corresponding path program 1 times [2025-03-15 00:25:29,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:29,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162308001] [2025-03-15 00:25:29,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:29,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:29,442 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:25:29,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:29,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162308001] [2025-03-15 00:25:29,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162308001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:29,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:29,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:25:29,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692400199] [2025-03-15 00:25:29,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:29,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:25:29,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:29,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:25:29,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:25:29,444 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 124 [2025-03-15 00:25:29,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 121 transitions, 411 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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:25:29,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:29,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 124 [2025-03-15 00:25:29,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:29,490 INFO L124 PetriNetUnfolderBase]: 18/176 cut-off events. [2025-03-15 00:25:29,490 INFO L125 PetriNetUnfolderBase]: For 228/308 co-relation queries the response was YES. [2025-03-15 00:25:29,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 176 events. 18/176 cut-off events. For 228/308 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 297 event pairs, 8 based on Foata normal form. 1/174 useless extension candidates. Maximal degree in co-relation 290. Up to 42 conditions per place. [2025-03-15 00:25:29,491 INFO L140 encePairwiseOnDemand]: 121/124 looper letters, 0 selfloop transitions, 0 changer transitions 120/120 dead transitions. [2025-03-15 00:25:29,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 120 transitions, 439 flow [2025-03-15 00:25:29,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:25:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:25:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2025-03-15 00:25:29,492 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9005376344086021 [2025-03-15 00:25:29,493 INFO L298 CegarLoopForPetriNet]: 128 programPoint places, 4 predicate places. [2025-03-15 00:25:29,493 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 120 transitions, 439 flow [2025-03-15 00:25:29,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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:25:29,500 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/04-mutex_43-thread_create_nr.i_petrified1_AllErrorsAtOnce [2025-03-15 00:25:29,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 10 remaining) [2025-03-15 00:25:29,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-15 00:25:29,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-15 00:25:29,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-15 00:25:29,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-15 00:25:29,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 10 remaining) [2025-03-15 00:25:29,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-15 00:25:29,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-15 00:25:29,518 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-15 00:25:29,518 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-15 00:25:29,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:25:29,518 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-15 00:25:29,521 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:25:29,522 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:25:29,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:25:29 BasicIcfg [2025-03-15 00:25:29,527 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:25:29,527 INFO L158 Benchmark]: Toolchain (without parser) took 2105.69ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 42.4MB in the beginning and 49.2MB in the end (delta: -6.8MB). Peak memory consumption was 44.7MB. Max. memory is 8.0GB. [2025-03-15 00:25:29,527 INFO L158 Benchmark]: CDTParser took 1.22ms. Allocated memory is still 71.3MB. Free memory was 34.8MB in the beginning and 34.8MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:25:29,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.86ms. Allocated memory is still 71.3MB. Free memory was 42.3MB in the beginning and 40.0MB in the end (delta: 2.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-03-15 00:25:29,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.15ms. Allocated memory is still 71.3MB. Free memory was 40.0MB in the beginning and 37.7MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:25:29,528 INFO L158 Benchmark]: Boogie Preprocessor took 24.80ms. Allocated memory is still 71.3MB. Free memory was 37.7MB in the beginning and 36.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:25:29,528 INFO L158 Benchmark]: RCFGBuilder took 298.69ms. Allocated memory is still 71.3MB. Free memory was 36.3MB in the beginning and 22.4MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 00:25:29,528 INFO L158 Benchmark]: TraceAbstraction took 1249.67ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 21.3MB in the beginning and 49.2MB in the end (delta: -27.9MB). Peak memory consumption was 23.7MB. Max. memory is 8.0GB. [2025-03-15 00:25:29,532 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.22ms. Allocated memory is still 71.3MB. Free memory was 34.8MB in the beginning and 34.8MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 481.86ms. Allocated memory is still 71.3MB. Free memory was 42.3MB in the beginning and 40.0MB in the end (delta: 2.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.15ms. Allocated memory is still 71.3MB. Free memory was 40.0MB in the beginning and 37.7MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.80ms. Allocated memory is still 71.3MB. Free memory was 37.7MB in the beginning and 36.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 298.69ms. Allocated memory is still 71.3MB. Free memory was 36.3MB in the beginning and 22.4MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 1249.67ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 21.3MB in the beginning and 49.2MB in the end (delta: -27.9MB). Peak memory consumption was 23.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 929]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 930]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 930]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 932]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 932]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 923]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 923]: 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 3 procedures, 143 locations, 10 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: 1.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 55 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=439occurred in iteration=6, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 518 NumberOfCodeBlocks, 518 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 512 ConstructedInterpolants, 0 QuantifiedInterpolants, 524 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 7 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 00:25:29,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...