/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/weaver/chl-sre-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:58:37,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:58:37,687 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:58:37,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:58:37,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:58:37,740 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:58:37,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:58:37,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:58:37,741 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:58:37,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:58:37,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:58:37,741 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:58:37,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:58:37,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:58:37,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:58:37,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:58:37,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:58:37,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:58:37,743 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:58:37,743 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:58:37,744 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:58:37,744 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:58:37,744 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:58:37,744 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:58:37,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:58:37,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:58:37,744 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:58:37,748 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:58:37,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:58:37,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:58:37,748 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:58:37,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:58:37,748 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:58:38,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:58:38,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:58:38,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:58:38,018 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:58:38,018 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:58:38,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-sre-trans.wvr.c [2025-03-15 00:58:39,173 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f7d26466/cdae0b2ad67049f38bd88985d8ebac53/FLAGf3717df24 [2025-03-15 00:58:39,346 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:58:39,347 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-sre-trans.wvr.c [2025-03-15 00:58:39,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f7d26466/cdae0b2ad67049f38bd88985d8ebac53/FLAGf3717df24 [2025-03-15 00:58:39,361 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f7d26466/cdae0b2ad67049f38bd88985d8ebac53 [2025-03-15 00:58:39,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:58:39,364 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:58:39,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:58:39,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:58:39,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:58:39,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:58:39" (1/1) ... [2025-03-15 00:58:39,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c6a2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:39, skipping insertion in model container [2025-03-15 00:58:39,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:58:39" (1/1) ... [2025-03-15 00:58:39,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:58:39,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:58:39,491 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:58:39,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:58:39,519 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:58:39,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:39 WrapperNode [2025-03-15 00:58:39,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:58:39,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:58:39,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:58:39,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:58:39,525 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:58:39" (1/1) ... [2025-03-15 00:58:39,529 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:58:39" (1/1) ... [2025-03-15 00:58:39,542 INFO L138 Inliner]: procedures = 21, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 85 [2025-03-15 00:58:39,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:58:39,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:58:39,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:58:39,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:58:39,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:39" (1/1) ... [2025-03-15 00:58:39,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:39" (1/1) ... [2025-03-15 00:58:39,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:39" (1/1) ... [2025-03-15 00:58:39,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:39" (1/1) ... [2025-03-15 00:58:39,559 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:39" (1/1) ... [2025-03-15 00:58:39,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:39" (1/1) ... [2025-03-15 00:58:39,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:39" (1/1) ... [2025-03-15 00:58:39,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:39" (1/1) ... [2025-03-15 00:58:39,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:39" (1/1) ... [2025-03-15 00:58:39,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:58:39,571 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:58:39,571 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:58:39,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:58:39,572 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:39" (1/1) ... [2025-03-15 00:58:39,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:58:39,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:58:39,603 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:58:39,606 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:58:39,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:58:39,624 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 00:58:39,624 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 00:58:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 00:58:39,626 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 00:58:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 00:58:39,626 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 00:58:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:58:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:58:39,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:58:39,627 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:58:39,702 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:58:39,703 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:58:39,884 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:58:39,884 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:58:39,893 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:58:39,893 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:58:39,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:58:39 BoogieIcfgContainer [2025-03-15 00:58:39,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:58:39,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:58:39,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:58:39,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:58:39,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:58:39" (1/3) ... [2025-03-15 00:58:39,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd4da75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:58:39, skipping insertion in model container [2025-03-15 00:58:39,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:39" (2/3) ... [2025-03-15 00:58:39,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd4da75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:58:39, skipping insertion in model container [2025-03-15 00:58:39,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:58:39" (3/3) ... [2025-03-15 00:58:39,900 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-sre-trans.wvr.c [2025-03-15 00:58:39,910 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:58:39,911 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-sre-trans.wvr.c that has 4 procedures, 167 locations, 1 initial locations, 0 loop locations, and 18 error locations. [2025-03-15 00:58:39,911 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:58:39,996 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-15 00:58:40,036 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:58:40,049 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;@3da53dce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:58:40,049 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-03-15 00:58:40,073 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:58:40,073 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-15 00:58:40,076 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:58:40,076 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:40,077 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] [2025-03-15 00:58:40,077 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 00:58:40,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:40,082 INFO L85 PathProgramCache]: Analyzing trace with hash 399894186, now seen corresponding path program 1 times [2025-03-15 00:58:40,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:40,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268541331] [2025-03-15 00:58:40,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:40,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:40,229 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:58:40,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:40,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268541331] [2025-03-15 00:58:40,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268541331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:40,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:40,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:40,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525602654] [2025-03-15 00:58:40,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:40,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:40,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:40,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:40,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:40,261 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 172 [2025-03-15 00:58:40,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 172 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 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:58:40,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:40,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 172 [2025-03-15 00:58:40,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:40,402 INFO L124 PetriNetUnfolderBase]: 33/335 cut-off events. [2025-03-15 00:58:40,402 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-15 00:58:40,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 335 events. 33/335 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1246 event pairs, 21 based on Foata normal form. 2/268 useless extension candidates. Maximal degree in co-relation 281. Up to 58 conditions per place. [2025-03-15 00:58:40,420 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 15 selfloop transitions, 2 changer transitions 13/160 dead transitions. [2025-03-15 00:58:40,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 160 transitions, 372 flow [2025-03-15 00:58:40,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-03-15 00:58:40,432 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-03-15 00:58:40,435 INFO L298 CegarLoopForPetriNet]: 176 programPoint places, -9 predicate places. [2025-03-15 00:58:40,435 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 160 transitions, 372 flow [2025-03-15 00:58:40,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 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:58:40,436 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:40,436 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] [2025-03-15 00:58:40,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:58:40,436 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 00:58:40,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:40,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1680129586, now seen corresponding path program 1 times [2025-03-15 00:58:40,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:40,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097808390] [2025-03-15 00:58:40,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:40,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:40,489 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:58:40,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:40,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097808390] [2025-03-15 00:58:40,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097808390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:40,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:40,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:40,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874551799] [2025-03-15 00:58:40,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:40,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:40,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:40,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:40,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:40,492 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 172 [2025-03-15 00:58:40,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 160 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 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:58:40,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:40,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 172 [2025-03-15 00:58:40,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:40,661 INFO L124 PetriNetUnfolderBase]: 182/1173 cut-off events. [2025-03-15 00:58:40,661 INFO L125 PetriNetUnfolderBase]: For 292/310 co-relation queries the response was YES. [2025-03-15 00:58:40,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1685 conditions, 1173 events. 182/1173 cut-off events. For 292/310 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8936 event pairs, 138 based on Foata normal form. 0/883 useless extension candidates. Maximal degree in co-relation 1453. Up to 236 conditions per place. [2025-03-15 00:58:40,673 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 18 selfloop transitions, 2 changer transitions 13/159 dead transitions. [2025-03-15 00:58:40,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 159 transitions, 410 flow [2025-03-15 00:58:40,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2025-03-15 00:58:40,675 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9011627906976745 [2025-03-15 00:58:40,676 INFO L298 CegarLoopForPetriNet]: 176 programPoint places, -8 predicate places. [2025-03-15 00:58:40,676 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 159 transitions, 410 flow [2025-03-15 00:58:40,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 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:58:40,676 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:40,676 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] [2025-03-15 00:58:40,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:58:40,677 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 00:58:40,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:40,677 INFO L85 PathProgramCache]: Analyzing trace with hash -631823420, now seen corresponding path program 1 times [2025-03-15 00:58:40,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:40,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799608978] [2025-03-15 00:58:40,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:40,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:40,743 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:58:40,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:40,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799608978] [2025-03-15 00:58:40,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799608978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:40,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:40,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:40,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586403392] [2025-03-15 00:58:40,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:40,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:40,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:40,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:40,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:40,747 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 172 [2025-03-15 00:58:40,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 159 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 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:58:40,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:40,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 172 [2025-03-15 00:58:40,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:41,155 INFO L124 PetriNetUnfolderBase]: 879/3195 cut-off events. [2025-03-15 00:58:41,155 INFO L125 PetriNetUnfolderBase]: For 1771/1958 co-relation queries the response was YES. [2025-03-15 00:58:41,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5573 conditions, 3195 events. 879/3195 cut-off events. For 1771/1958 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 30869 event pairs, 760 based on Foata normal form. 0/2320 useless extension candidates. Maximal degree in co-relation 5282. Up to 1354 conditions per place. [2025-03-15 00:58:41,181 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 21 selfloop transitions, 2 changer transitions 13/158 dead transitions. [2025-03-15 00:58:41,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 158 transitions, 454 flow [2025-03-15 00:58:41,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2025-03-15 00:58:41,184 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8895348837209303 [2025-03-15 00:58:41,184 INFO L298 CegarLoopForPetriNet]: 176 programPoint places, -7 predicate places. [2025-03-15 00:58:41,185 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 158 transitions, 454 flow [2025-03-15 00:58:41,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 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:58:41,185 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:41,185 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:58:41,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:58:41,185 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 00:58:41,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:41,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1537050951, now seen corresponding path program 1 times [2025-03-15 00:58:41,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:41,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424675458] [2025-03-15 00:58:41,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:41,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:41,248 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:58:41,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:41,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424675458] [2025-03-15 00:58:41,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424675458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:41,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:41,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:41,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400761001] [2025-03-15 00:58:41,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:41,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:41,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:41,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:41,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:41,250 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 172 [2025-03-15 00:58:41,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 158 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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:58:41,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:41,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 172 [2025-03-15 00:58:41,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:41,501 INFO L124 PetriNetUnfolderBase]: 746/2762 cut-off events. [2025-03-15 00:58:41,501 INFO L125 PetriNetUnfolderBase]: For 2616/2928 co-relation queries the response was YES. [2025-03-15 00:58:41,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5051 conditions, 2762 events. 746/2762 cut-off events. For 2616/2928 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 25519 event pairs, 638 based on Foata normal form. 0/2035 useless extension candidates. Maximal degree in co-relation 4332. Up to 1163 conditions per place. [2025-03-15 00:58:41,520 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 14 selfloop transitions, 2 changer transitions 13/160 dead transitions. [2025-03-15 00:58:41,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 160 transitions, 508 flow [2025-03-15 00:58:41,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2025-03-15 00:58:41,522 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.936046511627907 [2025-03-15 00:58:41,523 INFO L298 CegarLoopForPetriNet]: 176 programPoint places, -7 predicate places. [2025-03-15 00:58:41,523 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 160 transitions, 508 flow [2025-03-15 00:58:41,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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:58:41,523 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:41,523 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] [2025-03-15 00:58:41,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:58:41,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 00:58:41,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:41,524 INFO L85 PathProgramCache]: Analyzing trace with hash -362773143, now seen corresponding path program 1 times [2025-03-15 00:58:41,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:41,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795511538] [2025-03-15 00:58:41,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:41,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:41,587 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:58:41,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:41,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795511538] [2025-03-15 00:58:41,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795511538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:41,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:41,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:41,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076630347] [2025-03-15 00:58:41,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:41,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:41,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:41,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:41,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:41,589 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 172 [2025-03-15 00:58:41,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 160 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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:58:41,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:41,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 172 [2025-03-15 00:58:41,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:41,810 INFO L124 PetriNetUnfolderBase]: 678/2421 cut-off events. [2025-03-15 00:58:41,811 INFO L125 PetriNetUnfolderBase]: For 3788/4452 co-relation queries the response was YES. [2025-03-15 00:58:41,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4742 conditions, 2421 events. 678/2421 cut-off events. For 3788/4452 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 21308 event pairs, 494 based on Foata normal form. 1/1805 useless extension candidates. Maximal degree in co-relation 3312. Up to 1049 conditions per place. [2025-03-15 00:58:41,828 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 19 selfloop transitions, 2 changer transitions 13/162 dead transitions. [2025-03-15 00:58:41,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 162 transitions, 585 flow [2025-03-15 00:58:41,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2025-03-15 00:58:41,830 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9244186046511628 [2025-03-15 00:58:41,831 INFO L298 CegarLoopForPetriNet]: 176 programPoint places, -8 predicate places. [2025-03-15 00:58:41,831 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 162 transitions, 585 flow [2025-03-15 00:58:41,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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:58:41,831 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:41,831 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:58:41,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:58:41,832 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 00:58:41,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:41,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1232136880, now seen corresponding path program 1 times [2025-03-15 00:58:41,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:41,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42444538] [2025-03-15 00:58:41,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:41,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:41,885 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:58:41,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:41,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42444538] [2025-03-15 00:58:41,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42444538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:41,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:41,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:41,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496841236] [2025-03-15 00:58:41,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:41,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:41,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:41,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:41,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:41,887 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 172 [2025-03-15 00:58:41,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 162 transitions, 585 flow. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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:58:41,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:41,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 172 [2025-03-15 00:58:41,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:42,197 INFO L124 PetriNetUnfolderBase]: 937/3281 cut-off events. [2025-03-15 00:58:42,197 INFO L125 PetriNetUnfolderBase]: For 10191/11021 co-relation queries the response was YES. [2025-03-15 00:58:42,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6785 conditions, 3281 events. 937/3281 cut-off events. For 10191/11021 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 31206 event pairs, 730 based on Foata normal form. 31/2496 useless extension candidates. Maximal degree in co-relation 5969. Up to 1463 conditions per place. [2025-03-15 00:58:42,227 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 18 selfloop transitions, 2 changer transitions 13/163 dead transitions. [2025-03-15 00:58:42,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 163 transitions, 653 flow [2025-03-15 00:58:42,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:42,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:42,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2025-03-15 00:58:42,230 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.937984496124031 [2025-03-15 00:58:42,232 INFO L298 CegarLoopForPetriNet]: 176 programPoint places, -7 predicate places. [2025-03-15 00:58:42,232 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 163 transitions, 653 flow [2025-03-15 00:58:42,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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:58:42,233 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:42,233 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:58:42,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:58:42,233 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 00:58:42,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:42,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1123246906, now seen corresponding path program 1 times [2025-03-15 00:58:42,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:42,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147120697] [2025-03-15 00:58:42,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:42,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:42,290 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:58:42,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:42,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147120697] [2025-03-15 00:58:42,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147120697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:42,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:42,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:42,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857888958] [2025-03-15 00:58:42,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:42,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:42,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:42,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:42,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:42,292 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 172 [2025-03-15 00:58:42,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 163 transitions, 653 flow. Second operand has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 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:58:42,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:42,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 172 [2025-03-15 00:58:42,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:42,506 INFO L124 PetriNetUnfolderBase]: 510/2173 cut-off events. [2025-03-15 00:58:42,506 INFO L125 PetriNetUnfolderBase]: For 6512/7634 co-relation queries the response was YES. [2025-03-15 00:58:42,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5179 conditions, 2173 events. 510/2173 cut-off events. For 6512/7634 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 19249 event pairs, 238 based on Foata normal form. 2/1874 useless extension candidates. Maximal degree in co-relation 4460. Up to 729 conditions per place. [2025-03-15 00:58:42,523 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 27 selfloop transitions, 2 changer transitions 13/165 dead transitions. [2025-03-15 00:58:42,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 165 transitions, 771 flow [2025-03-15 00:58:42,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:42,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-03-15 00:58:42,525 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9127906976744186 [2025-03-15 00:58:42,525 INFO L298 CegarLoopForPetriNet]: 176 programPoint places, -9 predicate places. [2025-03-15 00:58:42,525 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 165 transitions, 771 flow [2025-03-15 00:58:42,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 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:58:42,526 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:42,526 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] [2025-03-15 00:58:42,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:58:42,526 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 00:58:42,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:42,527 INFO L85 PathProgramCache]: Analyzing trace with hash -213060863, now seen corresponding path program 1 times [2025-03-15 00:58:42,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:42,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985450091] [2025-03-15 00:58:42,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:42,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:42,564 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:58:42,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:42,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985450091] [2025-03-15 00:58:42,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985450091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:42,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:42,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:42,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853520122] [2025-03-15 00:58:42,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:42,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:42,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:42,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:42,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:42,566 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 172 [2025-03-15 00:58:42,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 165 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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:58:42,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:42,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 172 [2025-03-15 00:58:42,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:42,795 INFO L124 PetriNetUnfolderBase]: 643/2463 cut-off events. [2025-03-15 00:58:42,795 INFO L125 PetriNetUnfolderBase]: For 15058/16629 co-relation queries the response was YES. [2025-03-15 00:58:42,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6894 conditions, 2463 events. 643/2463 cut-off events. For 15058/16629 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 22323 event pairs, 277 based on Foata normal form. 0/2113 useless extension candidates. Maximal degree in co-relation 5908. Up to 869 conditions per place. [2025-03-15 00:58:42,816 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 26 selfloop transitions, 2 changer transitions 13/168 dead transitions. [2025-03-15 00:58:42,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 168 transitions, 901 flow [2025-03-15 00:58:42,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:42,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2025-03-15 00:58:42,818 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.937984496124031 [2025-03-15 00:58:42,818 INFO L298 CegarLoopForPetriNet]: 176 programPoint places, -8 predicate places. [2025-03-15 00:58:42,818 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 168 transitions, 901 flow [2025-03-15 00:58:42,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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:58:42,819 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:58:42,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:58:42,819 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 00:58:42,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:42,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1797757084, now seen corresponding path program 1 times [2025-03-15 00:58:42,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:42,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138318594] [2025-03-15 00:58:42,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:42,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:42,877 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:58:42,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:42,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138318594] [2025-03-15 00:58:42,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138318594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:42,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:42,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:42,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637279636] [2025-03-15 00:58:42,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:42,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:42,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:42,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:42,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:42,878 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 172 [2025-03-15 00:58:42,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 168 transitions, 901 flow. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 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:58:42,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:42,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 172 [2025-03-15 00:58:42,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:43,061 INFO L124 PetriNetUnfolderBase]: 774/2415 cut-off events. [2025-03-15 00:58:43,061 INFO L125 PetriNetUnfolderBase]: For 30397/32721 co-relation queries the response was YES. [2025-03-15 00:58:43,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8334 conditions, 2415 events. 774/2415 cut-off events. For 30397/32721 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 21385 event pairs, 402 based on Foata normal form. 1/2082 useless extension candidates. Maximal degree in co-relation 6131. Up to 1002 conditions per place. [2025-03-15 00:58:43,077 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 28 selfloop transitions, 2 changer transitions 13/170 dead transitions. [2025-03-15 00:58:43,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 170 transitions, 1024 flow [2025-03-15 00:58:43,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:43,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2025-03-15 00:58:43,079 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.937984496124031 [2025-03-15 00:58:43,080 INFO L298 CegarLoopForPetriNet]: 176 programPoint places, -7 predicate places. [2025-03-15 00:58:43,080 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 170 transitions, 1024 flow [2025-03-15 00:58:43,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 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:58:43,080 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:43,080 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] [2025-03-15 00:58:43,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:58:43,081 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 00:58:43,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:43,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1710874910, now seen corresponding path program 1 times [2025-03-15 00:58:43,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:43,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167996498] [2025-03-15 00:58:43,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:43,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:43,155 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:58:43,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:43,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167996498] [2025-03-15 00:58:43,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167996498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:43,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:43,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:43,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899143782] [2025-03-15 00:58:43,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:43,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:43,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:43,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:43,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:43,157 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 172 [2025-03-15 00:58:43,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 170 transitions, 1024 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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:58:43,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:43,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 172 [2025-03-15 00:58:43,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:43,315 INFO L124 PetriNetUnfolderBase]: 737/2386 cut-off events. [2025-03-15 00:58:43,317 INFO L125 PetriNetUnfolderBase]: For 34516/37020 co-relation queries the response was YES. [2025-03-15 00:58:43,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8675 conditions, 2386 events. 737/2386 cut-off events. For 34516/37020 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 21401 event pairs, 231 based on Foata normal form. 0/2061 useless extension candidates. Maximal degree in co-relation 7493. Up to 959 conditions per place. [2025-03-15 00:58:43,335 INFO L140 encePairwiseOnDemand]: 170/172 looper letters, 27 selfloop transitions, 1 changer transitions 13/169 dead transitions. [2025-03-15 00:58:43,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 169 transitions, 1076 flow [2025-03-15 00:58:43,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2025-03-15 00:58:43,336 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.939922480620155 [2025-03-15 00:58:43,337 INFO L298 CegarLoopForPetriNet]: 176 programPoint places, -6 predicate places. [2025-03-15 00:58:43,337 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 169 transitions, 1076 flow [2025-03-15 00:58:43,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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:58:43,337 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:43,337 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] [2025-03-15 00:58:43,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:58:43,337 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 00:58:43,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:43,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1631243265, now seen corresponding path program 1 times [2025-03-15 00:58:43,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:43,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260727265] [2025-03-15 00:58:43,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:43,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:43,414 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:58:43,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:43,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260727265] [2025-03-15 00:58:43,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260727265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:43,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:43,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:43,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387713003] [2025-03-15 00:58:43,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:43,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:43,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:43,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:43,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:43,416 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 172 [2025-03-15 00:58:43,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 169 transitions, 1076 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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:58:43,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:43,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 172 [2025-03-15 00:58:43,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:43,686 INFO L124 PetriNetUnfolderBase]: 805/2501 cut-off events. [2025-03-15 00:58:43,687 INFO L125 PetriNetUnfolderBase]: For 42820/45641 co-relation queries the response was YES. [2025-03-15 00:58:43,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9408 conditions, 2501 events. 805/2501 cut-off events. For 42820/45641 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 22385 event pairs, 259 based on Foata normal form. 0/2163 useless extension candidates. Maximal degree in co-relation 8707. Up to 1010 conditions per place. [2025-03-15 00:58:43,704 INFO L140 encePairwiseOnDemand]: 170/172 looper letters, 27 selfloop transitions, 1 changer transitions 13/168 dead transitions. [2025-03-15 00:58:43,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 168 transitions, 1128 flow [2025-03-15 00:58:43,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:43,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2025-03-15 00:58:43,705 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.939922480620155 [2025-03-15 00:58:43,706 INFO L298 CegarLoopForPetriNet]: 176 programPoint places, -5 predicate places. [2025-03-15 00:58:43,706 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 168 transitions, 1128 flow [2025-03-15 00:58:43,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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:58:43,706 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:43,706 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] [2025-03-15 00:58:43,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:58:43,706 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2025-03-15 00:58:43,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:43,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1226830784, now seen corresponding path program 1 times [2025-03-15 00:58:43,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:43,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568808404] [2025-03-15 00:58:43,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:43,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:43,757 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:58:43,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:43,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568808404] [2025-03-15 00:58:43,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568808404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:43,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:43,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:43,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126285365] [2025-03-15 00:58:43,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:43,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:43,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:43,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:43,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:43,759 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 172 [2025-03-15 00:58:43,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 168 transitions, 1128 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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:58:43,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:43,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 172 [2025-03-15 00:58:43,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:43,945 INFO L124 PetriNetUnfolderBase]: 769/2469 cut-off events. [2025-03-15 00:58:43,945 INFO L125 PetriNetUnfolderBase]: For 49890/52701 co-relation queries the response was YES. [2025-03-15 00:58:43,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9847 conditions, 2469 events. 769/2469 cut-off events. For 49890/52701 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 21945 event pairs, 307 based on Foata normal form. 0/2135 useless extension candidates. Maximal degree in co-relation 9041. Up to 977 conditions per place. [2025-03-15 00:58:43,953 INFO L140 encePairwiseOnDemand]: 170/172 looper letters, 0 selfloop transitions, 0 changer transitions 167/167 dead transitions. [2025-03-15 00:58:43,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 167 transitions, 1180 flow [2025-03-15 00:58:43,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:43,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2025-03-15 00:58:43,954 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.939922480620155 [2025-03-15 00:58:43,956 INFO L298 CegarLoopForPetriNet]: 176 programPoint places, -4 predicate places. [2025-03-15 00:58:43,956 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 167 transitions, 1180 flow [2025-03-15 00:58:43,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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:58:43,962 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/chl-sre-trans.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 00:58:43,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (32 of 33 remaining) [2025-03-15 00:58:43,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (31 of 33 remaining) [2025-03-15 00:58:43,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 33 remaining) [2025-03-15 00:58:43,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (29 of 33 remaining) [2025-03-15 00:58:43,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (28 of 33 remaining) [2025-03-15 00:58:43,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (27 of 33 remaining) [2025-03-15 00:58:43,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (26 of 33 remaining) [2025-03-15 00:58:43,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (25 of 33 remaining) [2025-03-15 00:58:43,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (24 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (23 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (22 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (21 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (15 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (11 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (10 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (9 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (8 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (7 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (6 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (5 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (4 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (3 of 33 remaining) [2025-03-15 00:58:43,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (2 of 33 remaining) [2025-03-15 00:58:43,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (1 of 33 remaining) [2025-03-15 00:58:43,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (0 of 33 remaining) [2025-03-15 00:58:43,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:58:43,989 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:58:43,996 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:58:43,996 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:58:44,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:58:44 BasicIcfg [2025-03-15 00:58:44,002 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:58:44,003 INFO L158 Benchmark]: Toolchain (without parser) took 4638.86ms. Allocated memory was 71.3MB in the beginning and 335.5MB in the end (delta: 264.2MB). Free memory was 44.1MB in the beginning and 199.1MB in the end (delta: -155.0MB). Peak memory consumption was 280.3MB. Max. memory is 8.0GB. [2025-03-15 00:58:44,004 INFO L158 Benchmark]: CDTParser took 1.18ms. Allocated memory is still 71.3MB. Free memory is still 36.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:58:44,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.19ms. Allocated memory is still 71.3MB. Free memory was 43.9MB in the beginning and 32.4MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-03-15 00:58:44,004 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.43ms. Allocated memory is still 71.3MB. Free memory was 32.4MB in the beginning and 31.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:58:44,005 INFO L158 Benchmark]: Boogie Preprocessor took 27.57ms. Allocated memory is still 71.3MB. Free memory was 31.1MB in the beginning and 30.1MB in the end (delta: 986.5kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:58:44,006 INFO L158 Benchmark]: RCFGBuilder took 321.90ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 40.5MB in the end (delta: -10.6MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. [2025-03-15 00:58:44,006 INFO L158 Benchmark]: TraceAbstraction took 4107.27ms. Allocated memory was 71.3MB in the beginning and 335.5MB in the end (delta: 264.2MB). Free memory was 39.7MB in the beginning and 199.1MB in the end (delta: -159.4MB). Peak memory consumption was 273.3MB. Max. memory is 8.0GB. [2025-03-15 00:58:44,007 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 is still 36.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 155.19ms. Allocated memory is still 71.3MB. Free memory was 43.9MB in the beginning and 32.4MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.43ms. Allocated memory is still 71.3MB. Free memory was 32.4MB in the beginning and 31.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.57ms. Allocated memory is still 71.3MB. Free memory was 31.1MB in the beginning and 30.1MB in the end (delta: 986.5kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 321.90ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 40.5MB in the end (delta: -10.6MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. * TraceAbstraction took 4107.27ms. Allocated memory was 71.3MB in the beginning and 335.5MB in the end (delta: 264.2MB). Free memory was 39.7MB in the beginning and 199.1MB in the end (delta: -159.4MB). Peak memory consumption was 273.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: 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 7 procedures, 239 locations, 33 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: 4.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 224 IncrementalHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 87 mSDtfsCounter, 224 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1180occurred in iteration=12, 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.5s InterpolantComputationTime, 770 NumberOfCodeBlocks, 770 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 758 ConstructedInterpolants, 0 QuantifiedInterpolants, 782 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 00:58:44,021 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...