/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/weaver/parallel-misc-2-unrolled.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:59:41,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:59:41,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 00:59:41,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:59:41,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:59:41,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:59:41,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:59:41,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:59:41,717 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:59:41,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:59:41,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:59:41,717 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:59:41,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:59:41,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:59:41,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:59:41,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:59:41,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:59:41,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:59:41,717 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:59:41,717 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:59:41,717 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:59:41,717 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:59:41,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:59:41,718 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:59:41,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:59:41,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:59:41,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:59:41,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:59:41,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:59:41,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:59:41,718 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:59:41,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:59:41,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2025-03-15 00:59:42,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:59:42,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:59:42,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:59:42,018 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:59:42,019 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:59:42,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2-unrolled.wvr.c [2025-03-15 00:59:43,295 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/164711921/3991beaf2da34118840e9fc96f1c4e1b/FLAG3834550f7 [2025-03-15 00:59:43,476 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:59:43,477 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2-unrolled.wvr.c [2025-03-15 00:59:43,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/164711921/3991beaf2da34118840e9fc96f1c4e1b/FLAG3834550f7 [2025-03-15 00:59:43,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/164711921/3991beaf2da34118840e9fc96f1c4e1b [2025-03-15 00:59:43,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:59:43,506 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:59:43,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:59:43,507 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:59:43,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:59:43,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:59:43" (1/1) ... [2025-03-15 00:59:43,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2697348b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:43, skipping insertion in model container [2025-03-15 00:59:43,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:59:43" (1/1) ... [2025-03-15 00:59:43,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:59:43,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:59:43,663 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:59:43,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:59:43,691 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:59:43,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:43 WrapperNode [2025-03-15 00:59:43,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:59:43,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:59:43,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:59:43,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:59:43,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:43" (1/1) ... [2025-03-15 00:59:43,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:43" (1/1) ... [2025-03-15 00:59:43,714 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 74 [2025-03-15 00:59:43,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:59:43,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:59:43,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:59:43,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:59:43,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:43" (1/1) ... [2025-03-15 00:59:43,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:43" (1/1) ... [2025-03-15 00:59:43,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:43" (1/1) ... [2025-03-15 00:59:43,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:43" (1/1) ... [2025-03-15 00:59:43,726 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:43" (1/1) ... [2025-03-15 00:59:43,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:43" (1/1) ... [2025-03-15 00:59:43,730 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:43" (1/1) ... [2025-03-15 00:59:43,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:43" (1/1) ... [2025-03-15 00:59:43,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:43" (1/1) ... [2025-03-15 00:59:43,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:59:43,737 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:59:43,737 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:59:43,737 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:59:43,738 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:43" (1/1) ... [2025-03-15 00:59:43,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:59:43,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:59:43,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 00:59:43,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 00:59:43,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:59:43,782 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 00:59:43,782 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 00:59:43,782 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 00:59:43,782 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 00:59:43,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:59:43,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:59:43,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:59:43,783 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 00:59:43,842 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:59:43,843 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:59:44,028 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:59:44,028 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:59:44,042 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:59:44,042 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-15 00:59:44,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:59:44 BoogieIcfgContainer [2025-03-15 00:59:44,043 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:59:44,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:59:44,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:59:44,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:59:44,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:59:43" (1/3) ... [2025-03-15 00:59:44,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34693c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:59:44, skipping insertion in model container [2025-03-15 00:59:44,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:43" (2/3) ... [2025-03-15 00:59:44,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34693c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:59:44, skipping insertion in model container [2025-03-15 00:59:44,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:59:44" (3/3) ... [2025-03-15 00:59:44,052 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2-unrolled.wvr.c [2025-03-15 00:59:44,064 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:59:44,066 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2-unrolled.wvr.c that has 3 procedures, 160 locations, 1 initial locations, 2 loop locations, and 17 error locations. [2025-03-15 00:59:44,067 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:59:44,127 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 00:59:44,159 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:59:44,167 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;@44573b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:59:44,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-15 00:59:44,185 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:59:44,185 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-03-15 00:59:44,190 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:59:44,190 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:44,191 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] [2025-03-15 00:59:44,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-15 00:59:44,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:44,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1721127835, now seen corresponding path program 1 times [2025-03-15 00:59:44,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:44,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502066498] [2025-03-15 00:59:44,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:44,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:44,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:44,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502066498] [2025-03-15 00:59:44,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502066498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:44,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:44,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:44,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490528214] [2025-03-15 00:59:44,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:44,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:44,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:44,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:44,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:44,357 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 166 [2025-03-15 00:59:44,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 166 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:44,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:44,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 166 [2025-03-15 00:59:44,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:44,510 INFO L124 PetriNetUnfolderBase]: 21/206 cut-off events. [2025-03-15 00:59:44,510 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-15 00:59:44,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 206 events. 21/206 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 619 event pairs, 17 based on Foata normal form. 22/197 useless extension candidates. Maximal degree in co-relation 223. Up to 63 conditions per place. [2025-03-15 00:59:44,518 INFO L140 encePairwiseOnDemand]: 158/166 looper letters, 26 selfloop transitions, 2 changer transitions 10/152 dead transitions. [2025-03-15 00:59:44,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 152 transitions, 374 flow [2025-03-15 00:59:44,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:44,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2025-03-15 00:59:44,530 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8534136546184738 [2025-03-15 00:59:44,533 INFO L298 CegarLoopForPetriNet]: 166 programPoint places, -8 predicate places. [2025-03-15 00:59:44,534 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 152 transitions, 374 flow [2025-03-15 00:59:44,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:44,534 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:44,534 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] [2025-03-15 00:59:44,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:59:44,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-15 00:59:44,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:44,535 INFO L85 PathProgramCache]: Analyzing trace with hash -436424367, now seen corresponding path program 1 times [2025-03-15 00:59:44,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:44,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033134098] [2025-03-15 00:59:44,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:44,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:44,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:44,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:44,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033134098] [2025-03-15 00:59:44,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033134098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:44,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:44,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:44,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059357929] [2025-03-15 00:59:44,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:44,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:44,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:44,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:44,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:44,586 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 166 [2025-03-15 00:59:44,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 152 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:44,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:44,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 166 [2025-03-15 00:59:44,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:44,714 INFO L124 PetriNetUnfolderBase]: 69/355 cut-off events. [2025-03-15 00:59:44,715 INFO L125 PetriNetUnfolderBase]: For 298/424 co-relation queries the response was YES. [2025-03-15 00:59:44,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 355 events. 69/355 cut-off events. For 298/424 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1835 event pairs, 62 based on Foata normal form. 0/292 useless extension candidates. Maximal degree in co-relation 452. Up to 140 conditions per place. [2025-03-15 00:59:44,721 INFO L140 encePairwiseOnDemand]: 163/166 looper letters, 26 selfloop transitions, 2 changer transitions 10/151 dead transitions. [2025-03-15 00:59:44,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 151 transitions, 430 flow [2025-03-15 00:59:44,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:44,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2025-03-15 00:59:44,725 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8433734939759037 [2025-03-15 00:59:44,725 INFO L298 CegarLoopForPetriNet]: 166 programPoint places, -7 predicate places. [2025-03-15 00:59:44,725 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 151 transitions, 430 flow [2025-03-15 00:59:44,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:44,725 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:44,726 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:44,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:59:44,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-15 00:59:44,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:44,726 INFO L85 PathProgramCache]: Analyzing trace with hash -432495734, now seen corresponding path program 1 times [2025-03-15 00:59:44,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:44,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517524298] [2025-03-15 00:59:44,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:44,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:44,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:44,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:44,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517524298] [2025-03-15 00:59:44,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517524298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:44,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:44,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:44,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567652254] [2025-03-15 00:59:44,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:44,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:44,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:44,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:44,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:44,757 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 166 [2025-03-15 00:59:44,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 151 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:44,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:44,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 166 [2025-03-15 00:59:44,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:44,850 INFO L124 PetriNetUnfolderBase]: 99/490 cut-off events. [2025-03-15 00:59:44,850 INFO L125 PetriNetUnfolderBase]: For 589/670 co-relation queries the response was YES. [2025-03-15 00:59:44,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1026 conditions, 490 events. 99/490 cut-off events. For 589/670 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2724 event pairs, 83 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 757. Up to 203 conditions per place. [2025-03-15 00:59:44,856 INFO L140 encePairwiseOnDemand]: 163/166 looper letters, 14 selfloop transitions, 2 changer transitions 10/150 dead transitions. [2025-03-15 00:59:44,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 150 transitions, 462 flow [2025-03-15 00:59:44,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:44,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:44,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2025-03-15 00:59:44,858 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.891566265060241 [2025-03-15 00:59:44,859 INFO L298 CegarLoopForPetriNet]: 166 programPoint places, -6 predicate places. [2025-03-15 00:59:44,859 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 150 transitions, 462 flow [2025-03-15 00:59:44,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:44,859 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:44,860 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] [2025-03-15 00:59:44,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:59:44,860 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-15 00:59:44,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:44,860 INFO L85 PathProgramCache]: Analyzing trace with hash 190731625, now seen corresponding path program 1 times [2025-03-15 00:59:44,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:44,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053176564] [2025-03-15 00:59:44,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:44,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:44,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:44,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053176564] [2025-03-15 00:59:44,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053176564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:44,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:44,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:44,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129277581] [2025-03-15 00:59:44,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:44,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:44,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:44,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:44,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:44,924 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 166 [2025-03-15 00:59:44,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 150 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:44,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:44,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 166 [2025-03-15 00:59:44,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:45,017 INFO L124 PetriNetUnfolderBase]: 96/481 cut-off events. [2025-03-15 00:59:45,017 INFO L125 PetriNetUnfolderBase]: For 891/1242 co-relation queries the response was YES. [2025-03-15 00:59:45,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 481 events. 96/481 cut-off events. For 891/1242 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2595 event pairs, 73 based on Foata normal form. 9/403 useless extension candidates. Maximal degree in co-relation 816. Up to 200 conditions per place. [2025-03-15 00:59:45,020 INFO L140 encePairwiseOnDemand]: 157/166 looper letters, 18 selfloop transitions, 5 changer transitions 10/148 dead transitions. [2025-03-15 00:59:45,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 148 transitions, 509 flow [2025-03-15 00:59:45,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2025-03-15 00:59:45,022 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8634538152610441 [2025-03-15 00:59:45,022 INFO L298 CegarLoopForPetriNet]: 166 programPoint places, -8 predicate places. [2025-03-15 00:59:45,022 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 148 transitions, 509 flow [2025-03-15 00:59:45,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:45,022 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:45,023 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:45,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:59:45,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-15 00:59:45,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:45,023 INFO L85 PathProgramCache]: Analyzing trace with hash -529649843, now seen corresponding path program 1 times [2025-03-15 00:59:45,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:45,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437374532] [2025-03-15 00:59:45,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:45,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:45,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:45,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:45,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437374532] [2025-03-15 00:59:45,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437374532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:45,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:45,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:45,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543616899] [2025-03-15 00:59:45,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:45,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:45,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:45,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:45,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:45,073 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 166 [2025-03-15 00:59:45,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 148 transitions, 509 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:45,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:45,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 166 [2025-03-15 00:59:45,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:45,157 INFO L124 PetriNetUnfolderBase]: 107/560 cut-off events. [2025-03-15 00:59:45,157 INFO L125 PetriNetUnfolderBase]: For 1218/1446 co-relation queries the response was YES. [2025-03-15 00:59:45,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1512 conditions, 560 events. 107/560 cut-off events. For 1218/1446 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3258 event pairs, 49 based on Foata normal form. 0/488 useless extension candidates. Maximal degree in co-relation 873. Up to 195 conditions per place. [2025-03-15 00:59:45,161 INFO L140 encePairwiseOnDemand]: 157/166 looper letters, 24 selfloop transitions, 5 changer transitions 10/151 dead transitions. [2025-03-15 00:59:45,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 151 transitions, 629 flow [2025-03-15 00:59:45,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:45,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2025-03-15 00:59:45,162 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8714859437751004 [2025-03-15 00:59:45,163 INFO L298 CegarLoopForPetriNet]: 166 programPoint places, -10 predicate places. [2025-03-15 00:59:45,163 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 151 transitions, 629 flow [2025-03-15 00:59:45,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:45,163 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:45,163 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] [2025-03-15 00:59:45,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:59:45,163 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-15 00:59:45,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:45,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1559106136, now seen corresponding path program 1 times [2025-03-15 00:59:45,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:45,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828930394] [2025-03-15 00:59:45,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:45,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:45,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:45,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828930394] [2025-03-15 00:59:45,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828930394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:45,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:45,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:45,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585753626] [2025-03-15 00:59:45,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:45,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:45,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:45,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:45,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:45,216 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 166 [2025-03-15 00:59:45,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 151 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:45,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:45,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 166 [2025-03-15 00:59:45,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:45,272 INFO L124 PetriNetUnfolderBase]: 104/556 cut-off events. [2025-03-15 00:59:45,272 INFO L125 PetriNetUnfolderBase]: For 1785/1976 co-relation queries the response was YES. [2025-03-15 00:59:45,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1641 conditions, 556 events. 104/556 cut-off events. For 1785/1976 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3118 event pairs, 41 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 936. Up to 185 conditions per place. [2025-03-15 00:59:45,276 INFO L140 encePairwiseOnDemand]: 162/166 looper letters, 20 selfloop transitions, 2 changer transitions 10/153 dead transitions. [2025-03-15 00:59:45,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 153 transitions, 705 flow [2025-03-15 00:59:45,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:45,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:45,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2025-03-15 00:59:45,278 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9136546184738956 [2025-03-15 00:59:45,278 INFO L298 CegarLoopForPetriNet]: 166 programPoint places, -10 predicate places. [2025-03-15 00:59:45,278 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 153 transitions, 705 flow [2025-03-15 00:59:45,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:45,279 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:45,279 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:59:45,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:59:45,279 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-15 00:59:45,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:45,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1239103663, now seen corresponding path program 1 times [2025-03-15 00:59:45,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:45,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704219448] [2025-03-15 00:59:45,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:45,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:45,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:45,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:45,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704219448] [2025-03-15 00:59:45,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704219448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:45,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:45,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:45,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778943965] [2025-03-15 00:59:45,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:45,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:45,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:45,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:45,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:45,347 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 166 [2025-03-15 00:59:45,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 153 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:45,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:45,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 166 [2025-03-15 00:59:45,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:45,424 INFO L124 PetriNetUnfolderBase]: 106/553 cut-off events. [2025-03-15 00:59:45,424 INFO L125 PetriNetUnfolderBase]: For 2256/2491 co-relation queries the response was YES. [2025-03-15 00:59:45,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1821 conditions, 553 events. 106/553 cut-off events. For 2256/2491 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3110 event pairs, 42 based on Foata normal form. 3/505 useless extension candidates. Maximal degree in co-relation 1033. Up to 187 conditions per place. [2025-03-15 00:59:45,427 INFO L140 encePairwiseOnDemand]: 163/166 looper letters, 32 selfloop transitions, 2 changer transitions 10/154 dead transitions. [2025-03-15 00:59:45,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 154 transitions, 803 flow [2025-03-15 00:59:45,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2025-03-15 00:59:45,429 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8453815261044176 [2025-03-15 00:59:45,430 INFO L298 CegarLoopForPetriNet]: 166 programPoint places, -9 predicate places. [2025-03-15 00:59:45,430 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 154 transitions, 803 flow [2025-03-15 00:59:45,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:45,431 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:45,431 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] [2025-03-15 00:59:45,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:59:45,431 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-15 00:59:45,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:45,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1435417682, now seen corresponding path program 1 times [2025-03-15 00:59:45,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:45,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090777581] [2025-03-15 00:59:45,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:45,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:45,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:45,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090777581] [2025-03-15 00:59:45,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090777581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:45,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:45,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:45,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030168784] [2025-03-15 00:59:45,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:45,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:45,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:45,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:45,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:45,503 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 166 [2025-03-15 00:59:45,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 154 transitions, 803 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:45,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:45,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 166 [2025-03-15 00:59:45,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:45,596 INFO L124 PetriNetUnfolderBase]: 109/568 cut-off events. [2025-03-15 00:59:45,596 INFO L125 PetriNetUnfolderBase]: For 2910/3155 co-relation queries the response was YES. [2025-03-15 00:59:45,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 568 events. 109/568 cut-off events. For 2910/3155 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3020 event pairs, 31 based on Foata normal form. 0/522 useless extension candidates. Maximal degree in co-relation 1218. Up to 183 conditions per place. [2025-03-15 00:59:45,602 INFO L140 encePairwiseOnDemand]: 163/166 looper letters, 35 selfloop transitions, 2 changer transitions 10/156 dead transitions. [2025-03-15 00:59:45,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 156 transitions, 924 flow [2025-03-15 00:59:45,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2025-03-15 00:59:45,604 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8493975903614458 [2025-03-15 00:59:45,605 INFO L298 CegarLoopForPetriNet]: 166 programPoint places, -8 predicate places. [2025-03-15 00:59:45,605 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 156 transitions, 924 flow [2025-03-15 00:59:45,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:45,605 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:45,605 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] [2025-03-15 00:59:45,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:59:45,605 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-15 00:59:45,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:45,607 INFO L85 PathProgramCache]: Analyzing trace with hash -732931751, now seen corresponding path program 1 times [2025-03-15 00:59:45,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:45,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482052528] [2025-03-15 00:59:45,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:45,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:45,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:45,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482052528] [2025-03-15 00:59:45,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482052528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:45,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:45,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:45,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101324609] [2025-03-15 00:59:45,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:45,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:45,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:45,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:45,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:45,675 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 166 [2025-03-15 00:59:45,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 156 transitions, 924 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:45,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:45,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 166 [2025-03-15 00:59:45,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:45,753 INFO L124 PetriNetUnfolderBase]: 115/523 cut-off events. [2025-03-15 00:59:45,753 INFO L125 PetriNetUnfolderBase]: For 4033/4558 co-relation queries the response was YES. [2025-03-15 00:59:45,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2174 conditions, 523 events. 115/523 cut-off events. For 4033/4558 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2859 event pairs, 28 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 1175. Up to 190 conditions per place. [2025-03-15 00:59:45,756 INFO L140 encePairwiseOnDemand]: 163/166 looper letters, 36 selfloop transitions, 2 changer transitions 10/157 dead transitions. [2025-03-15 00:59:45,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 157 transitions, 1036 flow [2025-03-15 00:59:45,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:45,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:45,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2025-03-15 00:59:45,758 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8433734939759037 [2025-03-15 00:59:45,758 INFO L298 CegarLoopForPetriNet]: 166 programPoint places, -7 predicate places. [2025-03-15 00:59:45,759 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 157 transitions, 1036 flow [2025-03-15 00:59:45,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:45,759 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:45,759 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] [2025-03-15 00:59:45,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:59:45,759 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-15 00:59:45,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:45,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1478066444, now seen corresponding path program 1 times [2025-03-15 00:59:45,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:45,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749634043] [2025-03-15 00:59:45,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:45,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:45,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:45,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749634043] [2025-03-15 00:59:45,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749634043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:45,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:45,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:45,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581443566] [2025-03-15 00:59:45,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:45,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:45,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:45,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:45,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:45,800 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 166 [2025-03-15 00:59:45,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 157 transitions, 1036 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:45,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:45,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 166 [2025-03-15 00:59:45,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:45,886 INFO L124 PetriNetUnfolderBase]: 118/520 cut-off events. [2025-03-15 00:59:45,886 INFO L125 PetriNetUnfolderBase]: For 5165/5793 co-relation queries the response was YES. [2025-03-15 00:59:45,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2379 conditions, 520 events. 118/520 cut-off events. For 5165/5793 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2923 event pairs, 22 based on Foata normal form. 0/488 useless extension candidates. Maximal degree in co-relation 1297. Up to 187 conditions per place. [2025-03-15 00:59:45,891 INFO L140 encePairwiseOnDemand]: 163/166 looper letters, 0 selfloop transitions, 0 changer transitions 159/159 dead transitions. [2025-03-15 00:59:45,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 159 transitions, 1175 flow [2025-03-15 00:59:45,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2025-03-15 00:59:45,893 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8473895582329317 [2025-03-15 00:59:45,893 INFO L298 CegarLoopForPetriNet]: 166 programPoint places, -6 predicate places. [2025-03-15 00:59:45,893 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 159 transitions, 1175 flow [2025-03-15 00:59:45,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:59:45,899 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-misc-2-unrolled.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 00:59:45,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (30 of 31 remaining) [2025-03-15 00:59:45,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (29 of 31 remaining) [2025-03-15 00:59:45,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (28 of 31 remaining) [2025-03-15 00:59:45,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (27 of 31 remaining) [2025-03-15 00:59:45,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (26 of 31 remaining) [2025-03-15 00:59:45,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (25 of 31 remaining) [2025-03-15 00:59:45,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 31 remaining) [2025-03-15 00:59:45,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 31 remaining) [2025-03-15 00:59:45,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 31 remaining) [2025-03-15 00:59:45,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 31 remaining) [2025-03-15 00:59:45,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 31 remaining) [2025-03-15 00:59:45,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (19 of 31 remaining) [2025-03-15 00:59:45,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 31 remaining) [2025-03-15 00:59:45,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 31 remaining) [2025-03-15 00:59:45,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 31 remaining) [2025-03-15 00:59:45,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 31 remaining) [2025-03-15 00:59:45,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 31 remaining) [2025-03-15 00:59:45,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 31 remaining) [2025-03-15 00:59:45,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 31 remaining) [2025-03-15 00:59:45,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (11 of 31 remaining) [2025-03-15 00:59:45,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (10 of 31 remaining) [2025-03-15 00:59:45,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (9 of 31 remaining) [2025-03-15 00:59:45,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (8 of 31 remaining) [2025-03-15 00:59:45,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (7 of 31 remaining) [2025-03-15 00:59:45,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (6 of 31 remaining) [2025-03-15 00:59:45,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (5 of 31 remaining) [2025-03-15 00:59:45,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (4 of 31 remaining) [2025-03-15 00:59:45,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (3 of 31 remaining) [2025-03-15 00:59:45,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (2 of 31 remaining) [2025-03-15 00:59:45,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (1 of 31 remaining) [2025-03-15 00:59:45,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (0 of 31 remaining) [2025-03-15 00:59:45,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:59:45,924 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:45,928 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:59:45,929 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:59:45,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:59:45 BasicIcfg [2025-03-15 00:59:45,934 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:59:45,934 INFO L158 Benchmark]: Toolchain (without parser) took 2429.28ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 43.9MB in the beginning and 48.3MB in the end (delta: -4.4MB). Peak memory consumption was 66.9MB. Max. memory is 8.0GB. [2025-03-15 00:59:45,934 INFO L158 Benchmark]: CDTParser took 1.17ms. Allocated memory is still 71.3MB. Free memory was 37.1MB in the beginning and 37.1MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:59:45,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.00ms. Allocated memory is still 71.3MB. Free memory was 43.8MB in the beginning and 32.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 00:59:45,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.05ms. Allocated memory is still 71.3MB. Free memory was 32.3MB in the beginning and 31.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:59:45,935 INFO L158 Benchmark]: Boogie Preprocessor took 21.36ms. Allocated memory is still 71.3MB. Free memory was 31.0MB in the beginning and 30.0MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:59:45,935 INFO L158 Benchmark]: RCFGBuilder took 305.82ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 40.9MB in the end (delta: -10.9MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. [2025-03-15 00:59:45,935 INFO L158 Benchmark]: TraceAbstraction took 1888.02ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 40.0MB in the beginning and 48.3MB in the end (delta: -8.4MB). Peak memory consumption was 59.9MB. Max. memory is 8.0GB. [2025-03-15 00:59:45,937 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.17ms. Allocated memory is still 71.3MB. Free memory was 37.1MB in the beginning and 37.1MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 186.00ms. Allocated memory is still 71.3MB. Free memory was 43.8MB in the beginning and 32.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.05ms. Allocated memory is still 71.3MB. Free memory was 32.3MB in the beginning and 31.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 21.36ms. Allocated memory is still 71.3MB. Free memory was 31.0MB in the beginning and 30.0MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 305.82ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 40.9MB in the end (delta: -10.9MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. * TraceAbstraction took 1888.02ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 40.0MB in the beginning and 48.3MB in the end (delta: -8.4MB). Peak memory consumption was 59.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 234 locations, 31 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 147 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 267 IncrementalHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 147 mSDtfsCounter, 267 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1175occurred in iteration=10, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 532 NumberOfCodeBlocks, 532 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 522 ConstructedInterpolants, 0 QuantifiedInterpolants, 542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 17 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 00:59:45,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...