/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_42-trylock_2mutex.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:25:19,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:25:19,339 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:19,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:25:19,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:25:19,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:25:19,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:25:19,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:25:19,372 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:25:19,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:25:19,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:25:19,373 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:25:19,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:25:19,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:25:19,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:25:19,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:25:19,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:25:19,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:25:19,373 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:25:19,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:25:19,373 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:25:19,373 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:25:19,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:25:19,376 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:25:19,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:25:19,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:25:19,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:25:19,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:25:19,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:25:19,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:25:19,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:25:19,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:25:19,387 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:19,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:25:19,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:25:19,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:25:19,656 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:25:19,656 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:25:19,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_42-trylock_2mutex.i [2025-03-15 00:25:20,802 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad812e7a5/226de23293a94e949b9e012c45da9a6b/FLAG5bf1a4c75 [2025-03-15 00:25:21,056 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:25:21,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_42-trylock_2mutex.i [2025-03-15 00:25:21,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad812e7a5/226de23293a94e949b9e012c45da9a6b/FLAG5bf1a4c75 [2025-03-15 00:25:21,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad812e7a5/226de23293a94e949b9e012c45da9a6b [2025-03-15 00:25:21,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:25:21,088 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:25:21,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:25:21,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:25:21,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:25:21,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:25:21" (1/1) ... [2025-03-15 00:25:21,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67952578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:21, skipping insertion in model container [2025-03-15 00:25:21,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:25:21" (1/1) ... [2025-03-15 00:25:21,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:25:21,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:25:21,299 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:25:21,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:25:21,371 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:25:21,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:21 WrapperNode [2025-03-15 00:25:21,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:25:21,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:25:21,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:25:21,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:25:21,378 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:21" (1/1) ... [2025-03-15 00:25:21,391 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:21" (1/1) ... [2025-03-15 00:25:21,409 INFO L138 Inliner]: procedures = 163, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2025-03-15 00:25:21,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:25:21,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:25:21,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:25:21,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:25:21,415 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:21" (1/1) ... [2025-03-15 00:25:21,415 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:21" (1/1) ... [2025-03-15 00:25:21,417 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:21" (1/1) ... [2025-03-15 00:25:21,417 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:21" (1/1) ... [2025-03-15 00:25:21,422 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:21" (1/1) ... [2025-03-15 00:25:21,426 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:21" (1/1) ... [2025-03-15 00:25:21,429 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:21" (1/1) ... [2025-03-15 00:25:21,433 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:21" (1/1) ... [2025-03-15 00:25:21,434 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:21" (1/1) ... [2025-03-15 00:25:21,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:25:21,436 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:25:21,436 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:25:21,436 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:25:21,438 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:21" (1/1) ... [2025-03-15 00:25:21,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:25:21,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:25:21,466 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:21,469 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:21,498 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:25:21,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:25:21,498 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 00:25:21,498 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 00:25:21,498 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2025-03-15 00:25:21,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:25:21,498 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:25:21,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:25:21,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:25:21,499 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:21,602 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:25:21,604 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:25:21,728 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:25:21,728 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:25:21,758 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:25:21,758 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-15 00:25:21,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:25:21 BoogieIcfgContainer [2025-03-15 00:25:21,758 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:25:21,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:25:21,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:25:21,764 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:25:21,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:25:21" (1/3) ... [2025-03-15 00:25:21,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b2f448a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:25:21, skipping insertion in model container [2025-03-15 00:25:21,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:25:21" (2/3) ... [2025-03-15 00:25:21,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b2f448a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:25:21, skipping insertion in model container [2025-03-15 00:25:21,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:25:21" (3/3) ... [2025-03-15 00:25:21,765 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_42-trylock_2mutex.i [2025-03-15 00:25:21,777 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:25:21,778 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_42-trylock_2mutex.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-03-15 00:25:21,778 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:25:21,820 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-15 00:25:21,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:25:21,862 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;@71679667, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:25:21,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-15 00:25:21,893 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:25:21,894 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-15 00:25:21,896 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:25:21,896 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:21,897 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] [2025-03-15 00:25:21,897 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-15 00:25:21,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:21,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1013385580, now seen corresponding path program 1 times [2025-03-15 00:25:21,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:21,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668809061] [2025-03-15 00:25:21,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:21,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:22,119 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:22,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:22,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668809061] [2025-03-15 00:25:22,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668809061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:22,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:22,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:25:22,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709832555] [2025-03-15 00:25:22,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:22,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:25:22,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:22,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:25:22,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:25:22,156 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 91 [2025-03-15 00:25:22,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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:22,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:22,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 91 [2025-03-15 00:25:22,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:22,326 INFO L124 PetriNetUnfolderBase]: 94/426 cut-off events. [2025-03-15 00:25:22,326 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-15 00:25:22,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 426 events. 94/426 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2177 event pairs, 67 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 603. Up to 169 conditions per place. [2025-03-15 00:25:22,335 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 27 selfloop transitions, 4 changer transitions 5/100 dead transitions. [2025-03-15 00:25:22,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 100 transitions, 270 flow [2025-03-15 00:25:22,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:25:22,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:25:22,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2025-03-15 00:25:22,345 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8864468864468864 [2025-03-15 00:25:22,348 INFO L298 CegarLoopForPetriNet]: 93 programPoint places, 1 predicate places. [2025-03-15 00:25:22,349 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 100 transitions, 270 flow [2025-03-15 00:25:22,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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:22,349 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:22,349 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] [2025-03-15 00:25:22,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:25:22,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-15 00:25:22,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:22,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1164894699, now seen corresponding path program 1 times [2025-03-15 00:25:22,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:22,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353183456] [2025-03-15 00:25:22,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:22,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:22,433 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:22,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:22,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353183456] [2025-03-15 00:25:22,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353183456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:22,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:22,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:25:22,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446098551] [2025-03-15 00:25:22,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:22,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:25:22,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:22,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:25:22,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:25:22,436 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 91 [2025-03-15 00:25:22,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 100 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:22,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:22,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 91 [2025-03-15 00:25:22,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:22,590 INFO L124 PetriNetUnfolderBase]: 156/586 cut-off events. [2025-03-15 00:25:22,590 INFO L125 PetriNetUnfolderBase]: For 148/167 co-relation queries the response was YES. [2025-03-15 00:25:22,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 586 events. 156/586 cut-off events. For 148/167 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3219 event pairs, 71 based on Foata normal form. 3/525 useless extension candidates. Maximal degree in co-relation 1067. Up to 236 conditions per place. [2025-03-15 00:25:22,596 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 36 selfloop transitions, 4 changer transitions 6/115 dead transitions. [2025-03-15 00:25:22,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 115 transitions, 409 flow [2025-03-15 00:25:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:25:22,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:25:22,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2025-03-15 00:25:22,598 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8974358974358975 [2025-03-15 00:25:22,599 INFO L298 CegarLoopForPetriNet]: 93 programPoint places, 2 predicate places. [2025-03-15 00:25:22,599 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 115 transitions, 409 flow [2025-03-15 00:25:22,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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:22,599 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:22,599 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] [2025-03-15 00:25:22,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:25:22,599 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-15 00:25:22,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:22,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1894619998, now seen corresponding path program 1 times [2025-03-15 00:25:22,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:22,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901569758] [2025-03-15 00:25:22,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:22,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:22,661 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:22,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:22,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901569758] [2025-03-15 00:25:22,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901569758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:22,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:22,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:25:22,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966007719] [2025-03-15 00:25:22,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:22,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:25:22,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:22,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:25:22,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:25:22,663 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 91 [2025-03-15 00:25:22,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 115 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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:22,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:22,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 91 [2025-03-15 00:25:22,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:22,774 INFO L124 PetriNetUnfolderBase]: 181/632 cut-off events. [2025-03-15 00:25:22,775 INFO L125 PetriNetUnfolderBase]: For 403/482 co-relation queries the response was YES. [2025-03-15 00:25:22,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1533 conditions, 632 events. 181/632 cut-off events. For 403/482 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3530 event pairs, 62 based on Foata normal form. 3/572 useless extension candidates. Maximal degree in co-relation 1480. Up to 286 conditions per place. [2025-03-15 00:25:22,778 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 49 selfloop transitions, 5 changer transitions 6/126 dead transitions. [2025-03-15 00:25:22,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 126 transitions, 575 flow [2025-03-15 00:25:22,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:25:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:25:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 236 transitions. [2025-03-15 00:25:22,781 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8644688644688645 [2025-03-15 00:25:22,781 INFO L298 CegarLoopForPetriNet]: 93 programPoint places, 4 predicate places. [2025-03-15 00:25:22,781 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 126 transitions, 575 flow [2025-03-15 00:25:22,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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:22,782 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:22,782 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] [2025-03-15 00:25:22,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:25:22,782 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-15 00:25:22,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:22,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1302961165, now seen corresponding path program 1 times [2025-03-15 00:25:22,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:22,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290659475] [2025-03-15 00:25:22,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:22,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:22,837 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:22,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:22,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290659475] [2025-03-15 00:25:22,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290659475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:22,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:22,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:25:22,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002378500] [2025-03-15 00:25:22,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:22,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:25:22,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:22,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:25:22,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:25:22,838 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 91 [2025-03-15 00:25:22,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 126 transitions, 575 flow. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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:22,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:22,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 91 [2025-03-15 00:25:22,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:22,969 INFO L124 PetriNetUnfolderBase]: 207/733 cut-off events. [2025-03-15 00:25:22,969 INFO L125 PetriNetUnfolderBase]: For 866/972 co-relation queries the response was YES. [2025-03-15 00:25:22,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2072 conditions, 733 events. 207/733 cut-off events. For 866/972 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4261 event pairs, 59 based on Foata normal form. 4/682 useless extension candidates. Maximal degree in co-relation 2012. Up to 303 conditions per place. [2025-03-15 00:25:22,974 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 59 selfloop transitions, 10 changer transitions 10/144 dead transitions. [2025-03-15 00:25:22,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 144 transitions, 839 flow [2025-03-15 00:25:22,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:25:22,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:25:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2025-03-15 00:25:22,975 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8534798534798534 [2025-03-15 00:25:22,976 INFO L298 CegarLoopForPetriNet]: 93 programPoint places, 6 predicate places. [2025-03-15 00:25:22,976 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 144 transitions, 839 flow [2025-03-15 00:25:22,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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:22,977 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:22,977 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] [2025-03-15 00:25:22,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:25:22,977 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-15 00:25:22,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:22,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1880212976, now seen corresponding path program 1 times [2025-03-15 00:25:22,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:22,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854574559] [2025-03-15 00:25:22,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:22,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:23,223 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:23,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:23,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854574559] [2025-03-15 00:25:23,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854574559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:23,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:23,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 00:25:23,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472151759] [2025-03-15 00:25:23,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:23,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 00:25:23,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:23,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 00:25:23,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-15 00:25:23,225 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 91 [2025-03-15 00:25:23,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 144 transitions, 839 flow. Second operand has 7 states, 7 states have (on average 62.714285714285715) internal successors, (439), 7 states have internal predecessors, (439), 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:23,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:23,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 91 [2025-03-15 00:25:23,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:23,341 INFO L124 PetriNetUnfolderBase]: 94/411 cut-off events. [2025-03-15 00:25:23,341 INFO L125 PetriNetUnfolderBase]: For 1221/1299 co-relation queries the response was YES. [2025-03-15 00:25:23,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 411 events. 94/411 cut-off events. For 1221/1299 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1908 event pairs, 26 based on Foata normal form. 30/405 useless extension candidates. Maximal degree in co-relation 1138. Up to 143 conditions per place. [2025-03-15 00:25:23,343 INFO L140 encePairwiseOnDemand]: 81/91 looper letters, 25 selfloop transitions, 16 changer transitions 13/110 dead transitions. [2025-03-15 00:25:23,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 110 transitions, 659 flow [2025-03-15 00:25:23,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:25:23,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:25:23,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 398 transitions. [2025-03-15 00:25:23,345 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7289377289377289 [2025-03-15 00:25:23,346 INFO L298 CegarLoopForPetriNet]: 93 programPoint places, 8 predicate places. [2025-03-15 00:25:23,346 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 110 transitions, 659 flow [2025-03-15 00:25:23,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 62.714285714285715) internal successors, (439), 7 states have internal predecessors, (439), 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:23,346 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:23,346 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:25:23,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:25:23,346 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-15 00:25:23,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:23,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1225434134, now seen corresponding path program 1 times [2025-03-15 00:25:23,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:23,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701389465] [2025-03-15 00:25:23,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:23,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:23,383 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:23,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:23,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701389465] [2025-03-15 00:25:23,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701389465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:23,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:23,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:25:23,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609297110] [2025-03-15 00:25:23,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:23,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:25:23,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:23,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:25:23,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:25:23,384 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 91 [2025-03-15 00:25:23,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 110 transitions, 659 flow. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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:23,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:23,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 91 [2025-03-15 00:25:23,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:23,475 INFO L124 PetriNetUnfolderBase]: 110/447 cut-off events. [2025-03-15 00:25:23,475 INFO L125 PetriNetUnfolderBase]: For 1583/1687 co-relation queries the response was YES. [2025-03-15 00:25:23,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 447 events. 110/447 cut-off events. For 1583/1687 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2130 event pairs, 22 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 1475. Up to 185 conditions per place. [2025-03-15 00:25:23,477 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 33 selfloop transitions, 3 changer transitions 28/123 dead transitions. [2025-03-15 00:25:23,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 123 transitions, 893 flow [2025-03-15 00:25:23,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:25:23,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:25:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2025-03-15 00:25:23,478 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8608058608058609 [2025-03-15 00:25:23,479 INFO L298 CegarLoopForPetriNet]: 93 programPoint places, 10 predicate places. [2025-03-15 00:25:23,479 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 123 transitions, 893 flow [2025-03-15 00:25:23,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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:23,479 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:23,479 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:25:23,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:25:23,480 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-15 00:25:23,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:23,480 INFO L85 PathProgramCache]: Analyzing trace with hash 183897334, now seen corresponding path program 1 times [2025-03-15 00:25:23,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:23,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139025240] [2025-03-15 00:25:23,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:25:23,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:25:23,655 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:23,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:23,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139025240] [2025-03-15 00:25:23,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139025240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:23,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:23,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 00:25:23,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563878347] [2025-03-15 00:25:23,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:23,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 00:25:23,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:23,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 00:25:23,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-15 00:25:23,656 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 91 [2025-03-15 00:25:23,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 123 transitions, 893 flow. Second operand has 7 states, 7 states have (on average 63.0) internal successors, (441), 7 states have internal predecessors, (441), 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:23,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:23,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 91 [2025-03-15 00:25:23,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:23,812 INFO L124 PetriNetUnfolderBase]: 117/527 cut-off events. [2025-03-15 00:25:23,812 INFO L125 PetriNetUnfolderBase]: For 2272/2365 co-relation queries the response was YES. [2025-03-15 00:25:23,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1938 conditions, 527 events. 117/527 cut-off events. For 2272/2365 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2775 event pairs, 18 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 1836. Up to 221 conditions per place. [2025-03-15 00:25:23,815 INFO L140 encePairwiseOnDemand]: 82/91 looper letters, 33 selfloop transitions, 15 changer transitions 38/142 dead transitions. [2025-03-15 00:25:23,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 142 transitions, 1253 flow [2025-03-15 00:25:23,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 00:25:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 00:25:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 467 transitions. [2025-03-15 00:25:23,818 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7331240188383046 [2025-03-15 00:25:23,818 INFO L298 CegarLoopForPetriNet]: 93 programPoint places, 16 predicate places. [2025-03-15 00:25:23,819 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 142 transitions, 1253 flow [2025-03-15 00:25:23,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 63.0) internal successors, (441), 7 states have internal predecessors, (441), 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:23,819 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:23,819 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:25:23,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:25:23,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-15 00:25:23,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:23,820 INFO L85 PathProgramCache]: Analyzing trace with hash -843828908, now seen corresponding path program 2 times [2025-03-15 00:25:23,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:23,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562138184] [2025-03-15 00:25:23,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:25:23,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:23,834 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:25:23,834 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:25:23,928 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:23,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:23,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562138184] [2025-03-15 00:25:23,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562138184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:23,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:23,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 00:25:23,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680059055] [2025-03-15 00:25:23,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:23,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 00:25:23,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:23,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 00:25:23,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 00:25:23,930 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 91 [2025-03-15 00:25:23,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 142 transitions, 1253 flow. Second operand has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 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:23,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:23,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 91 [2025-03-15 00:25:23,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:24,040 INFO L124 PetriNetUnfolderBase]: 133/596 cut-off events. [2025-03-15 00:25:24,040 INFO L125 PetriNetUnfolderBase]: For 3616/3737 co-relation queries the response was YES. [2025-03-15 00:25:24,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2388 conditions, 596 events. 133/596 cut-off events. For 3616/3737 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3344 event pairs, 24 based on Foata normal form. 12/586 useless extension candidates. Maximal degree in co-relation 2273. Up to 245 conditions per place. [2025-03-15 00:25:24,043 INFO L140 encePairwiseOnDemand]: 82/91 looper letters, 20 selfloop transitions, 7 changer transitions 73/162 dead transitions. [2025-03-15 00:25:24,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 162 transitions, 1695 flow [2025-03-15 00:25:24,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 00:25:24,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 00:25:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 305 transitions. [2025-03-15 00:25:24,047 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8379120879120879 [2025-03-15 00:25:24,047 INFO L298 CegarLoopForPetriNet]: 93 programPoint places, 19 predicate places. [2025-03-15 00:25:24,047 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 162 transitions, 1695 flow [2025-03-15 00:25:24,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 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:24,048 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:25:24,048 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:25:24,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:25:24,048 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-15 00:25:24,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:25:24,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1839622804, now seen corresponding path program 3 times [2025-03-15 00:25:24,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:25:24,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474230969] [2025-03-15 00:25:24,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:25:24,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:25:24,062 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:25:24,062 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:25:24,143 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:24,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:25:24,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474230969] [2025-03-15 00:25:24,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474230969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:25:24,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:25:24,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 00:25:24,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916941907] [2025-03-15 00:25:24,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:25:24,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 00:25:24,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:25:24,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 00:25:24,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 00:25:24,145 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 91 [2025-03-15 00:25:24,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 162 transitions, 1695 flow. Second operand has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 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:24,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:25:24,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 91 [2025-03-15 00:25:24,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:25:24,232 INFO L124 PetriNetUnfolderBase]: 81/403 cut-off events. [2025-03-15 00:25:24,232 INFO L125 PetriNetUnfolderBase]: For 2909/2962 co-relation queries the response was YES. [2025-03-15 00:25:24,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1832 conditions, 403 events. 81/403 cut-off events. For 2909/2962 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1748 event pairs, 9 based on Foata normal form. 18/417 useless extension candidates. Maximal degree in co-relation 1704. Up to 162 conditions per place. [2025-03-15 00:25:24,233 INFO L140 encePairwiseOnDemand]: 82/91 looper letters, 0 selfloop transitions, 0 changer transitions 137/137 dead transitions. [2025-03-15 00:25:24,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 137 transitions, 1573 flow [2025-03-15 00:25:24,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 00:25:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 00:25:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 300 transitions. [2025-03-15 00:25:24,236 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8241758241758241 [2025-03-15 00:25:24,237 INFO L298 CegarLoopForPetriNet]: 93 programPoint places, 20 predicate places. [2025-03-15 00:25:24,237 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 137 transitions, 1573 flow [2025-03-15 00:25:24,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 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:24,241 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/04-mutex_42-trylock_2mutex.i_petrified1_AllErrorsAtOnce [2025-03-15 00:25:24,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 11 remaining) [2025-03-15 00:25:24,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-15 00:25:24,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 11 remaining) [2025-03-15 00:25:24,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-15 00:25:24,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-15 00:25:24,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-15 00:25:24,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-15 00:25:24,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-15 00:25:24,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-15 00:25:24,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-15 00:25:24,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-15 00:25:24,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:25:24,262 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2025-03-15 00:25:24,266 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:25:24,266 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:25:24,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:25:24 BasicIcfg [2025-03-15 00:25:24,269 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:25:24,269 INFO L158 Benchmark]: Toolchain (without parser) took 3181.20ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 42.5MB in the beginning and 54.0MB in the end (delta: -11.5MB). Peak memory consumption was 63.2MB. Max. memory is 8.0GB. [2025-03-15 00:25:24,270 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory is still 36.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:25:24,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.76ms. Allocated memory is still 71.3MB. Free memory was 42.3MB in the beginning and 22.7MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 00:25:24,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.83ms. Allocated memory is still 71.3MB. Free memory was 22.7MB in the beginning and 21.1MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:25:24,270 INFO L158 Benchmark]: Boogie Preprocessor took 25.87ms. Allocated memory is still 71.3MB. Free memory was 21.1MB in the beginning and 20.1MB in the end (delta: 972.7kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:25:24,270 INFO L158 Benchmark]: RCFGBuilder took 322.14ms. Allocated memory is still 71.3MB. Free memory was 20.0MB in the beginning and 31.3MB in the end (delta: -11.3MB). Peak memory consumption was 2.8MB. Max. memory is 8.0GB. [2025-03-15 00:25:24,270 INFO L158 Benchmark]: TraceAbstraction took 2509.25ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 30.3MB in the beginning and 54.0MB in the end (delta: -23.6MB). Peak memory consumption was 52.0MB. Max. memory is 8.0GB. [2025-03-15 00:25:24,273 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.18ms. Allocated memory is still 71.3MB. Free memory is still 36.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 283.76ms. Allocated memory is still 71.3MB. Free memory was 42.3MB in the beginning and 22.7MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.83ms. Allocated memory is still 71.3MB. Free memory was 22.7MB in the beginning and 21.1MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.87ms. Allocated memory is still 71.3MB. Free memory was 21.1MB in the beginning and 20.1MB in the end (delta: 972.7kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 322.14ms. Allocated memory is still 71.3MB. Free memory was 20.0MB in the beginning and 31.3MB in the end (delta: -11.3MB). Peak memory consumption was 2.8MB. Max. memory is 8.0GB. * TraceAbstraction took 2509.25ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 30.3MB in the beginning and 54.0MB in the end (delta: -23.6MB). Peak memory consumption was 52.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 699]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 699]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 684]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 684]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 687]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 687]: 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, 125 locations, 11 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: 2.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 150 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 150 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 509 IncrementalHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 92 mSDtfsCounter, 509 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1695occurred in iteration=8, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 395 NumberOfCodeBlocks, 395 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 386 ConstructedInterpolants, 0 QuantifiedInterpolants, 699 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 00:25:24,287 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...