/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/13-privatized_01-priv_nr_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:39:52,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:39:52,168 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:39:52,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:39:52,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:39:52,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:39:52,202 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:39:52,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:39:52,202 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:39:52,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:39:52,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:39:52,204 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:39:52,204 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:39:52,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:39:52,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:39:52,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:39:52,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:39:52,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:39:52,205 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:39:52,205 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:39:52,205 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:39:52,205 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:39:52,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:39:52,205 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:39:52,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:39:52,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:39:52,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:39:52,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:39:52,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:39:52,206 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:39:52,206 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:39:52,206 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:39:52,206 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:39:52,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:39:52,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:39:52,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:39:52,481 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:39:52,481 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:39:52,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_01-priv_nr_true.i [2025-03-15 00:39:53,706 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb19b68ac/10f14493b8b1484cb1294585258c729c/FLAG56ac4aba4 [2025-03-15 00:39:53,894 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:39:53,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_01-priv_nr_true.i [2025-03-15 00:39:53,907 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb19b68ac/10f14493b8b1484cb1294585258c729c/FLAG56ac4aba4 [2025-03-15 00:39:53,920 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb19b68ac/10f14493b8b1484cb1294585258c729c [2025-03-15 00:39:53,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:39:53,923 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:39:53,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:39:53,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:39:53,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:39:53,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:39:53" (1/1) ... [2025-03-15 00:39:53,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b6b5b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:39:53, skipping insertion in model container [2025-03-15 00:39:53,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:39:53" (1/1) ... [2025-03-15 00:39:53,947 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:39:54,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:39:54,139 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:39:54,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:39:54,217 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:39:54,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:39:54 WrapperNode [2025-03-15 00:39:54,218 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:39:54,219 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:39:54,219 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:39:54,219 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:39:54,223 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:39:54" (1/1) ... [2025-03-15 00:39:54,234 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:39:54" (1/1) ... [2025-03-15 00:39:54,256 INFO L138 Inliner]: procedures = 162, calls = 22, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 166 [2025-03-15 00:39:54,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:39:54,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:39:54,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:39:54,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:39:54,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:39:54" (1/1) ... [2025-03-15 00:39:54,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:39:54" (1/1) ... [2025-03-15 00:39:54,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:39:54" (1/1) ... [2025-03-15 00:39:54,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:39:54" (1/1) ... [2025-03-15 00:39:54,277 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:39:54" (1/1) ... [2025-03-15 00:39:54,278 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:39:54" (1/1) ... [2025-03-15 00:39:54,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:39:54" (1/1) ... [2025-03-15 00:39:54,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:39:54" (1/1) ... [2025-03-15 00:39:54,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:39:54" (1/1) ... [2025-03-15 00:39:54,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:39:54,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:39:54,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:39:54,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:39:54,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:39:54" (1/1) ... [2025-03-15 00:39:54,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:39:54,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:39:54,348 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:39:54,356 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:39:54,377 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:39:54,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:39:54,378 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 00:39:54,378 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 00:39:54,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:39:54,379 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:39:54,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:39:54,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:39:54,381 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:39:54,499 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:39:54,501 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:39:54,702 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:39:54,703 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:39:54,720 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:39:54,720 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:39:54,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:39:54 BoogieIcfgContainer [2025-03-15 00:39:54,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:39:54,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:39:54,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:39:54,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:39:54,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:39:53" (1/3) ... [2025-03-15 00:39:54,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b136448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:39:54, skipping insertion in model container [2025-03-15 00:39:54,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:39:54" (2/3) ... [2025-03-15 00:39:54,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b136448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:39:54, skipping insertion in model container [2025-03-15 00:39:54,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:39:54" (3/3) ... [2025-03-15 00:39:54,728 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_01-priv_nr_true.i [2025-03-15 00:39:54,741 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:39:54,742 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_01-priv_nr_true.i that has 2 procedures, 190 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-03-15 00:39:54,742 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:39:54,801 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-15 00:39:54,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:39:54,847 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;@53948bff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:39:54,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-15 00:39:54,898 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:39:54,899 INFO L124 PetriNetUnfolderBase]: 0/75 cut-off events. [2025-03-15 00:39:54,902 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:39:54,902 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:39:54,903 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:39:54,903 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-15 00:39:54,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:39:54,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1360425855, now seen corresponding path program 1 times [2025-03-15 00:39:54,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:39:54,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549716567] [2025-03-15 00:39:54,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:39:54,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:39:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:39:55,128 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:39:55,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:39:55,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549716567] [2025-03-15 00:39:55,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549716567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:39:55,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:39:55,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:39:55,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652403163] [2025-03-15 00:39:55,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:39:55,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:39:55,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:39:55,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:39:55,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:39:55,158 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 197 [2025-03-15 00:39:55,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 197 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 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:39:55,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:39:55,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 197 [2025-03-15 00:39:55,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:39:55,491 INFO L124 PetriNetUnfolderBase]: 258/1312 cut-off events. [2025-03-15 00:39:55,491 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-15 00:39:55,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1893 conditions, 1312 events. 258/1312 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 8532 event pairs, 103 based on Foata normal form. 126/1254 useless extension candidates. Maximal degree in co-relation 1789. Up to 305 conditions per place. [2025-03-15 00:39:55,501 INFO L140 encePairwiseOnDemand]: 168/197 looper letters, 45 selfloop transitions, 15 changer transitions 8/205 dead transitions. [2025-03-15 00:39:55,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 205 transitions, 538 flow [2025-03-15 00:39:55,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:39:55,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:39:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2025-03-15 00:39:55,514 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8934010152284264 [2025-03-15 00:39:55,517 INFO L298 CegarLoopForPetriNet]: 193 programPoint places, -8 predicate places. [2025-03-15 00:39:55,518 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 205 transitions, 538 flow [2025-03-15 00:39:55,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 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:39:55,518 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:39:55,518 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:39:55,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:39:55,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-15 00:39:55,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:39:55,520 INFO L85 PathProgramCache]: Analyzing trace with hash -426928251, now seen corresponding path program 1 times [2025-03-15 00:39:55,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:39:55,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197695973] [2025-03-15 00:39:55,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:39:55,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:39:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:39:55,637 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:39:55,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:39:55,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197695973] [2025-03-15 00:39:55,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197695973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:39:55,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:39:55,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:39:55,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203377462] [2025-03-15 00:39:55,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:39:55,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:39:55,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:39:55,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:39:55,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:39:55,644 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 197 [2025-03-15 00:39:55,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 205 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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:39:55,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:39:55,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 197 [2025-03-15 00:39:55,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:39:55,893 INFO L124 PetriNetUnfolderBase]: 304/1453 cut-off events. [2025-03-15 00:39:55,893 INFO L125 PetriNetUnfolderBase]: For 160/244 co-relation queries the response was YES. [2025-03-15 00:39:55,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2756 conditions, 1453 events. 304/1453 cut-off events. For 160/244 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 9680 event pairs, 95 based on Foata normal form. 2/1272 useless extension candidates. Maximal degree in co-relation 2645. Up to 605 conditions per place. [2025-03-15 00:39:55,902 INFO L140 encePairwiseOnDemand]: 189/197 looper letters, 73 selfloop transitions, 11 changer transitions 8/226 dead transitions. [2025-03-15 00:39:55,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 226 transitions, 792 flow [2025-03-15 00:39:55,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:39:55,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:39:55,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2025-03-15 00:39:55,905 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8307952622673435 [2025-03-15 00:39:55,906 INFO L298 CegarLoopForPetriNet]: 193 programPoint places, -6 predicate places. [2025-03-15 00:39:55,906 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 226 transitions, 792 flow [2025-03-15 00:39:55,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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:39:55,906 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:39:55,906 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:39:55,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:39:55,907 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-15 00:39:55,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:39:55,907 INFO L85 PathProgramCache]: Analyzing trace with hash 2091441062, now seen corresponding path program 1 times [2025-03-15 00:39:55,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:39:55,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491940640] [2025-03-15 00:39:55,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:39:55,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:39:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:39:56,118 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:39:56,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:39:56,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491940640] [2025-03-15 00:39:56,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491940640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:39:56,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:39:56,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:39:56,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021139870] [2025-03-15 00:39:56,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:39:56,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:39:56,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:39:56,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:39:56,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:39:56,121 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 197 [2025-03-15 00:39:56,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 226 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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:39:56,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:39:56,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 197 [2025-03-15 00:39:56,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:39:56,182 INFO L124 PetriNetUnfolderBase]: 1/245 cut-off events. [2025-03-15 00:39:56,182 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-15 00:39:56,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 245 events. 1/245 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 230 event pairs, 0 based on Foata normal form. 25/257 useless extension candidates. Maximal degree in co-relation 263. Up to 57 conditions per place. [2025-03-15 00:39:56,183 INFO L140 encePairwiseOnDemand]: 193/197 looper letters, 7 selfloop transitions, 6 changer transitions 17/177 dead transitions. [2025-03-15 00:39:56,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 177 transitions, 528 flow [2025-03-15 00:39:56,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:39:56,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:39:56,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 533 transitions. [2025-03-15 00:39:56,187 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9018612521150592 [2025-03-15 00:39:56,187 INFO L298 CegarLoopForPetriNet]: 193 programPoint places, -10 predicate places. [2025-03-15 00:39:56,187 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 177 transitions, 528 flow [2025-03-15 00:39:56,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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:39:56,188 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:39:56,188 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:39:56,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:39:56,189 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-15 00:39:56,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:39:56,190 INFO L85 PathProgramCache]: Analyzing trace with hash -403176614, now seen corresponding path program 1 times [2025-03-15 00:39:56,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:39:56,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957217359] [2025-03-15 00:39:56,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:39:56,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:39:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:39:56,258 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:39:56,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:39:56,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957217359] [2025-03-15 00:39:56,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957217359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:39:56,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:39:56,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:39:56,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461819538] [2025-03-15 00:39:56,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:39:56,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:39:56,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:39:56,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:39:56,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:39:56,260 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 197 [2025-03-15 00:39:56,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 177 transitions, 528 flow. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 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:39:56,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:39:56,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 197 [2025-03-15 00:39:56,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:39:56,328 INFO L124 PetriNetUnfolderBase]: 1/243 cut-off events. [2025-03-15 00:39:56,328 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-03-15 00:39:56,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 243 events. 1/243 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 222 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 309. Up to 55 conditions per place. [2025-03-15 00:39:56,329 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 31 selfloop transitions, 2 changer transitions 17/176 dead transitions. [2025-03-15 00:39:56,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 176 transitions, 590 flow [2025-03-15 00:39:56,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:39:56,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:39:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2025-03-15 00:39:56,331 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7986463620981388 [2025-03-15 00:39:56,332 INFO L298 CegarLoopForPetriNet]: 193 programPoint places, -9 predicate places. [2025-03-15 00:39:56,332 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 176 transitions, 590 flow [2025-03-15 00:39:56,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 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:39:56,333 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:39:56,333 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:39:56,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:39:56,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-15 00:39:56,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:39:56,334 INFO L85 PathProgramCache]: Analyzing trace with hash -238212455, now seen corresponding path program 1 times [2025-03-15 00:39:56,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:39:56,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871218334] [2025-03-15 00:39:56,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:39:56,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:39:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:39:56,395 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:39:56,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:39:56,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871218334] [2025-03-15 00:39:56,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871218334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:39:56,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:39:56,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:39:56,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769500016] [2025-03-15 00:39:56,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:39:56,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:39:56,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:39:56,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:39:56,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:39:56,397 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 197 [2025-03-15 00:39:56,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 176 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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:39:56,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:39:56,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 197 [2025-03-15 00:39:56,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:39:56,458 INFO L124 PetriNetUnfolderBase]: 1/241 cut-off events. [2025-03-15 00:39:56,458 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2025-03-15 00:39:56,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 241 events. 1/241 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 217 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 351. Up to 53 conditions per place. [2025-03-15 00:39:56,459 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 27 selfloop transitions, 2 changer transitions 25/175 dead transitions. [2025-03-15 00:39:56,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 175 transitions, 652 flow [2025-03-15 00:39:56,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:39:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:39:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2025-03-15 00:39:56,460 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7901861252115059 [2025-03-15 00:39:56,461 INFO L298 CegarLoopForPetriNet]: 193 programPoint places, -8 predicate places. [2025-03-15 00:39:56,461 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 175 transitions, 652 flow [2025-03-15 00:39:56,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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:39:56,461 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:39:56,461 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:39:56,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:39:56,462 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-15 00:39:56,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:39:56,462 INFO L85 PathProgramCache]: Analyzing trace with hash -542412696, now seen corresponding path program 1 times [2025-03-15 00:39:56,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:39:56,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47958848] [2025-03-15 00:39:56,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:39:56,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:39:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:39:56,510 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:39:56,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:39:56,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47958848] [2025-03-15 00:39:56,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47958848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:39:56,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:39:56,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:39:56,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295740392] [2025-03-15 00:39:56,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:39:56,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:39:56,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:39:56,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:39:56,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:39:56,514 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 197 [2025-03-15 00:39:56,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 175 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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:39:56,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:39:56,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 197 [2025-03-15 00:39:56,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:39:56,565 INFO L124 PetriNetUnfolderBase]: 1/239 cut-off events. [2025-03-15 00:39:56,565 INFO L125 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2025-03-15 00:39:56,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 239 events. 1/239 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 210 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 389. Up to 51 conditions per place. [2025-03-15 00:39:56,566 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 0 selfloop transitions, 0 changer transitions 174/174 dead transitions. [2025-03-15 00:39:56,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 174 transitions, 706 flow [2025-03-15 00:39:56,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:39:56,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:39:56,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2025-03-15 00:39:56,568 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7952622673434856 [2025-03-15 00:39:56,568 INFO L298 CegarLoopForPetriNet]: 193 programPoint places, -7 predicate places. [2025-03-15 00:39:56,568 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 174 transitions, 706 flow [2025-03-15 00:39:56,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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:39:56,575 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/13-privatized_01-priv_nr_true.i_petrified1_AllErrorsAtOnce [2025-03-15 00:39:56,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2025-03-15 00:39:56,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-03-15 00:39:56,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-03-15 00:39:56,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-03-15 00:39:56,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-03-15 00:39:56,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-03-15 00:39:56,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2025-03-15 00:39:56,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-03-15 00:39:56,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-03-15 00:39:56,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-03-15 00:39:56,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-03-15 00:39:56,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-03-15 00:39:56,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-03-15 00:39:56,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-03-15 00:39:56,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-03-15 00:39:56,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:39:56,591 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-15 00:39:56,595 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:39:56,595 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:39:56,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:39:56 BasicIcfg [2025-03-15 00:39:56,599 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:39:56,599 INFO L158 Benchmark]: Toolchain (without parser) took 2676.04ms. Allocated memory was 71.3MB in the beginning and 125.8MB in the end (delta: 54.5MB). Free memory was 43.6MB in the beginning and 52.4MB in the end (delta: -8.8MB). Peak memory consumption was 47.7MB. Max. memory is 8.0GB. [2025-03-15 00:39:56,599 INFO L158 Benchmark]: CDTParser took 1.18ms. Allocated memory is still 71.3MB. Free memory was 35.0MB in the beginning and 34.9MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:39:56,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.75ms. Allocated memory is still 71.3MB. Free memory was 43.4MB in the beginning and 23.7MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 00:39:56,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.94ms. Allocated memory is still 71.3MB. Free memory was 23.7MB in the beginning and 21.7MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:39:56,600 INFO L158 Benchmark]: Boogie Preprocessor took 30.02ms. Allocated memory is still 71.3MB. Free memory was 21.7MB in the beginning and 20.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:39:56,600 INFO L158 Benchmark]: RCFGBuilder took 432.99ms. Allocated memory is still 71.3MB. Free memory was 20.2MB in the beginning and 29.1MB in the end (delta: -8.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2025-03-15 00:39:56,600 INFO L158 Benchmark]: TraceAbstraction took 1875.79ms. Allocated memory was 71.3MB in the beginning and 125.8MB in the end (delta: 54.5MB). Free memory was 28.1MB in the beginning and 52.4MB in the end (delta: -24.4MB). Peak memory consumption was 27.9MB. Max. memory is 8.0GB. [2025-03-15 00:39:56,601 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.18ms. Allocated memory is still 71.3MB. Free memory was 35.0MB in the beginning and 34.9MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 293.75ms. Allocated memory is still 71.3MB. Free memory was 43.4MB in the beginning and 23.7MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.94ms. Allocated memory is still 71.3MB. Free memory was 23.7MB in the beginning and 21.7MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.02ms. Allocated memory is still 71.3MB. Free memory was 21.7MB in the beginning and 20.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 432.99ms. Allocated memory is still 71.3MB. Free memory was 20.2MB in the beginning and 29.1MB in the end (delta: -8.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * TraceAbstraction took 1875.79ms. Allocated memory was 71.3MB in the beginning and 125.8MB in the end (delta: 54.5MB). Free memory was 28.1MB in the beginning and 52.4MB in the end (delta: -24.4MB). Peak memory consumption was 27.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 700]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 700]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 701]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 702]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 702]: 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: 689]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 690]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: 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, 241 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.8s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 133 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 222 IncrementalHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 133 mSDtfsCounter, 222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=792occurred in iteration=2, 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.5s InterpolantComputationTime, 608 NumberOfCodeBlocks, 608 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 602 ConstructedInterpolants, 0 QuantifiedInterpolants, 642 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 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 00:39:56,616 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...