/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-simple-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:00:15,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:00:15,902 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 01:00:15,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:00:15,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:00:15,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:00:15,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:00:15,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:00:15,927 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:00:15,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:00:15,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:00:15,927 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:00:15,928 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:00:15,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:00:15,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:00:15,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:00:15,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:00:15,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:00:15,928 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:00:15,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:00:15,928 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:00:15,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:00:15,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:00:15,928 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:00:15,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:00:15,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:00:15,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:00:15,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:00:15,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:00:15,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:00:15,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:00:15,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:00:15,929 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 01:00:16,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:00:16,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:00:16,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:00:16,304 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:00:16,304 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:00:16,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-simple-equiv.wvr.c [2025-03-15 01:00:17,507 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda4b49f8/6db9f28514fb4018bb51cb63f20dc618/FLAG800594759 [2025-03-15 01:00:17,657 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:00:17,657 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-simple-equiv.wvr.c [2025-03-15 01:00:17,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda4b49f8/6db9f28514fb4018bb51cb63f20dc618/FLAG800594759 [2025-03-15 01:00:17,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda4b49f8/6db9f28514fb4018bb51cb63f20dc618 [2025-03-15 01:00:17,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:00:17,685 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:00:17,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:00:17,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:00:17,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:00:17,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:00:17" (1/1) ... [2025-03-15 01:00:17,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c90df7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:17, skipping insertion in model container [2025-03-15 01:00:17,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:00:17" (1/1) ... [2025-03-15 01:00:17,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:00:17,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:00:17,843 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:00:17,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:00:17,877 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:00:17,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:17 WrapperNode [2025-03-15 01:00:17,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:00:17,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:00:17,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:00:17,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:00:17,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:17" (1/1) ... [2025-03-15 01:00:17,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:17" (1/1) ... [2025-03-15 01:00:17,906 INFO L138 Inliner]: procedures = 19, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 70 [2025-03-15 01:00:17,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:00:17,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:00:17,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:00:17,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:00:17,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:17" (1/1) ... [2025-03-15 01:00:17,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:17" (1/1) ... [2025-03-15 01:00:17,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:17" (1/1) ... [2025-03-15 01:00:17,916 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:17" (1/1) ... [2025-03-15 01:00:17,923 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:17" (1/1) ... [2025-03-15 01:00:17,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:17" (1/1) ... [2025-03-15 01:00:17,929 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:17" (1/1) ... [2025-03-15 01:00:17,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:17" (1/1) ... [2025-03-15 01:00:17,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:17" (1/1) ... [2025-03-15 01:00:17,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:00:17,935 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:00:17,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:00:17,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:00:17,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:17" (1/1) ... [2025-03-15 01:00:17,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:00:17,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:00:17,969 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 01:00:17,971 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 01:00:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:00:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 01:00:17,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 01:00:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 01:00:17,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 01:00:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 01:00:17,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 01:00:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:00:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:00:17,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:00:17,990 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 01:00:18,052 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:00:18,054 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:00:18,216 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:00:18,216 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:00:18,236 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:00:18,236 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:00:18,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:00:18 BoogieIcfgContainer [2025-03-15 01:00:18,237 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:00:18,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:00:18,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:00:18,243 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:00:18,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:00:17" (1/3) ... [2025-03-15 01:00:18,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4f7c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:00:18, skipping insertion in model container [2025-03-15 01:00:18,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:00:17" (2/3) ... [2025-03-15 01:00:18,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4f7c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:00:18, skipping insertion in model container [2025-03-15 01:00:18,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:00:18" (3/3) ... [2025-03-15 01:00:18,246 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-simple-equiv.wvr.c [2025-03-15 01:00:18,258 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:00:18,260 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-simple-equiv.wvr.c that has 4 procedures, 135 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-03-15 01:00:18,260 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:00:18,334 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-15 01:00:18,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:00:18,387 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;@133c1d8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:00:18,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-15 01:00:18,411 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:00:18,412 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-03-15 01:00:18,414 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:00:18,415 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:18,415 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 01:00:18,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread3Err0ASSERT_VIOLATIONDATA_RACE, thread3Err1ASSERT_VIOLATIONDATA_RACE, thread3Err2ASSERT_VIOLATIONDATA_RACE, thread3Err3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-03-15 01:00:18,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:18,421 INFO L85 PathProgramCache]: Analyzing trace with hash 499808123, now seen corresponding path program 1 times [2025-03-15 01:00:18,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:18,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030819807] [2025-03-15 01:00:18,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:18,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:18,586 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 01:00:18,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:18,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030819807] [2025-03-15 01:00:18,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030819807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:18,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:18,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:18,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195281893] [2025-03-15 01:00:18,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:18,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:18,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:18,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:18,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:18,621 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 136 [2025-03-15 01:00:18,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 136 transitions, 293 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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 01:00:18,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:18,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 136 [2025-03-15 01:00:18,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:18,817 INFO L124 PetriNetUnfolderBase]: 103/490 cut-off events. [2025-03-15 01:00:18,818 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-03-15 01:00:18,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 490 events. 103/490 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2239 event pairs, 103 based on Foata normal form. 3/422 useless extension candidates. Maximal degree in co-relation 626. Up to 211 conditions per place. [2025-03-15 01:00:18,831 INFO L140 encePairwiseOnDemand]: 130/136 looper letters, 28 selfloop transitions, 2 changer transitions 10/123 dead transitions. [2025-03-15 01:00:18,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 123 transitions, 326 flow [2025-03-15 01:00:18,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2025-03-15 01:00:18,843 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.821078431372549 [2025-03-15 01:00:18,846 INFO L298 CegarLoopForPetriNet]: 144 programPoint places, -9 predicate places. [2025-03-15 01:00:18,846 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 123 transitions, 326 flow [2025-03-15 01:00:18,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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 01:00:18,846 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:18,846 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 01:00:18,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:00:18,847 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread3Err0ASSERT_VIOLATIONDATA_RACE, thread3Err1ASSERT_VIOLATIONDATA_RACE, thread3Err2ASSERT_VIOLATIONDATA_RACE, thread3Err3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-03-15 01:00:18,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:18,847 INFO L85 PathProgramCache]: Analyzing trace with hash -691008764, now seen corresponding path program 1 times [2025-03-15 01:00:18,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:18,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85168476] [2025-03-15 01:00:18,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:18,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:18,907 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 01:00:18,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:18,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85168476] [2025-03-15 01:00:18,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85168476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:18,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:18,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:18,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583323423] [2025-03-15 01:00:18,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:18,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:18,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:18,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:18,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:18,910 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 136 [2025-03-15 01:00:18,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 123 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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 01:00:18,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:18,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 136 [2025-03-15 01:00:18,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:19,042 INFO L124 PetriNetUnfolderBase]: 199/585 cut-off events. [2025-03-15 01:00:19,042 INFO L125 PetriNetUnfolderBase]: For 597/617 co-relation queries the response was YES. [2025-03-15 01:00:19,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1291 conditions, 585 events. 199/585 cut-off events. For 597/617 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2963 event pairs, 199 based on Foata normal form. 0/515 useless extension candidates. Maximal degree in co-relation 1138. Up to 307 conditions per place. [2025-03-15 01:00:19,050 INFO L140 encePairwiseOnDemand]: 133/136 looper letters, 23 selfloop transitions, 2 changer transitions 10/122 dead transitions. [2025-03-15 01:00:19,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 122 transitions, 374 flow [2025-03-15 01:00:19,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2025-03-15 01:00:19,052 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8431372549019608 [2025-03-15 01:00:19,054 INFO L298 CegarLoopForPetriNet]: 144 programPoint places, -8 predicate places. [2025-03-15 01:00:19,054 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 122 transitions, 374 flow [2025-03-15 01:00:19,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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 01:00:19,055 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:19,055 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] [2025-03-15 01:00:19,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:00:19,055 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread3Err0ASSERT_VIOLATIONDATA_RACE, thread3Err1ASSERT_VIOLATIONDATA_RACE, thread3Err2ASSERT_VIOLATIONDATA_RACE, thread3Err3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-03-15 01:00:19,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:19,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1972543682, now seen corresponding path program 1 times [2025-03-15 01:00:19,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:19,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742718825] [2025-03-15 01:00:19,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:19,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:19,101 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 01:00:19,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:19,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742718825] [2025-03-15 01:00:19,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742718825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:19,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:19,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:19,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042789901] [2025-03-15 01:00:19,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:19,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:19,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:19,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:19,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:19,103 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 136 [2025-03-15 01:00:19,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 122 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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 01:00:19,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:19,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 136 [2025-03-15 01:00:19,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:19,205 INFO L124 PetriNetUnfolderBase]: 183/553 cut-off events. [2025-03-15 01:00:19,205 INFO L125 PetriNetUnfolderBase]: For 899/942 co-relation queries the response was YES. [2025-03-15 01:00:19,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1479 conditions, 553 events. 183/553 cut-off events. For 899/942 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2692 event pairs, 135 based on Foata normal form. 0/501 useless extension candidates. Maximal degree in co-relation 1310. Up to 285 conditions per place. [2025-03-15 01:00:19,209 INFO L140 encePairwiseOnDemand]: 127/136 looper letters, 20 selfloop transitions, 4 changer transitions 16/122 dead transitions. [2025-03-15 01:00:19,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 122 transitions, 444 flow [2025-03-15 01:00:19,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:19,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2025-03-15 01:00:19,211 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8431372549019608 [2025-03-15 01:00:19,211 INFO L298 CegarLoopForPetriNet]: 144 programPoint places, -10 predicate places. [2025-03-15 01:00:19,211 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 122 transitions, 444 flow [2025-03-15 01:00:19,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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 01:00:19,212 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:19,212 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:19,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:00:19,212 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread3Err0ASSERT_VIOLATIONDATA_RACE, thread3Err1ASSERT_VIOLATIONDATA_RACE, thread3Err2ASSERT_VIOLATIONDATA_RACE, thread3Err3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-03-15 01:00:19,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:19,212 INFO L85 PathProgramCache]: Analyzing trace with hash 312560932, now seen corresponding path program 1 times [2025-03-15 01:00:19,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:19,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959998627] [2025-03-15 01:00:19,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:19,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:19,301 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 01:00:19,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:19,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959998627] [2025-03-15 01:00:19,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959998627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:19,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:19,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:19,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582244462] [2025-03-15 01:00:19,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:19,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:19,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:19,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:19,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:19,303 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 136 [2025-03-15 01:00:19,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 122 transitions, 444 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:19,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:19,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 136 [2025-03-15 01:00:19,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:19,408 INFO L124 PetriNetUnfolderBase]: 191/554 cut-off events. [2025-03-15 01:00:19,408 INFO L125 PetriNetUnfolderBase]: For 1295/1357 co-relation queries the response was YES. [2025-03-15 01:00:19,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 554 events. 191/554 cut-off events. For 1295/1357 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2689 event pairs, 127 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 1614. Up to 286 conditions per place. [2025-03-15 01:00:19,412 INFO L140 encePairwiseOnDemand]: 133/136 looper letters, 28 selfloop transitions, 2 changer transitions 16/125 dead transitions. [2025-03-15 01:00:19,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 125 transitions, 540 flow [2025-03-15 01:00:19,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2025-03-15 01:00:19,414 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8627450980392157 [2025-03-15 01:00:19,414 INFO L298 CegarLoopForPetriNet]: 144 programPoint places, -9 predicate places. [2025-03-15 01:00:19,414 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 125 transitions, 540 flow [2025-03-15 01:00:19,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:00:19,415 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:19,415 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] [2025-03-15 01:00:19,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:00:19,415 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread3Err0ASSERT_VIOLATIONDATA_RACE, thread3Err1ASSERT_VIOLATIONDATA_RACE, thread3Err2ASSERT_VIOLATIONDATA_RACE, thread3Err3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-03-15 01:00:19,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:19,415 INFO L85 PathProgramCache]: Analyzing trace with hash 13955208, now seen corresponding path program 1 times [2025-03-15 01:00:19,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:19,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155308914] [2025-03-15 01:00:19,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:19,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:19,468 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 01:00:19,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:19,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155308914] [2025-03-15 01:00:19,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155308914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:19,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:19,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:19,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603578352] [2025-03-15 01:00:19,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:19,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:19,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:19,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:19,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:19,470 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2025-03-15 01:00:19,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 125 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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 01:00:19,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:19,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2025-03-15 01:00:19,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:19,579 INFO L124 PetriNetUnfolderBase]: 175/524 cut-off events. [2025-03-15 01:00:19,580 INFO L125 PetriNetUnfolderBase]: For 1689/1769 co-relation queries the response was YES. [2025-03-15 01:00:19,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1926 conditions, 524 events. 175/524 cut-off events. For 1689/1769 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2479 event pairs, 63 based on Foata normal form. 0/493 useless extension candidates. Maximal degree in co-relation 1725. Up to 267 conditions per place. [2025-03-15 01:00:19,583 INFO L140 encePairwiseOnDemand]: 131/136 looper letters, 27 selfloop transitions, 3 changer transitions 16/127 dead transitions. [2025-03-15 01:00:19,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 127 transitions, 636 flow [2025-03-15 01:00:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:19,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2025-03-15 01:00:19,585 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8700980392156863 [2025-03-15 01:00:19,585 INFO L298 CegarLoopForPetriNet]: 144 programPoint places, -9 predicate places. [2025-03-15 01:00:19,585 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 127 transitions, 636 flow [2025-03-15 01:00:19,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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 01:00:19,585 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:19,585 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] [2025-03-15 01:00:19,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:00:19,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread3Err0ASSERT_VIOLATIONDATA_RACE, thread3Err1ASSERT_VIOLATIONDATA_RACE, thread3Err2ASSERT_VIOLATIONDATA_RACE, thread3Err3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-03-15 01:00:19,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:19,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1258925045, now seen corresponding path program 1 times [2025-03-15 01:00:19,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:19,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246546294] [2025-03-15 01:00:19,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:19,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:19,641 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 01:00:19,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:19,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246546294] [2025-03-15 01:00:19,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246546294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:19,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:19,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:19,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432609484] [2025-03-15 01:00:19,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:19,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:19,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:19,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:19,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:19,642 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 136 [2025-03-15 01:00:19,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 127 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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 01:00:19,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:19,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 136 [2025-03-15 01:00:19,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:19,733 INFO L124 PetriNetUnfolderBase]: 183/525 cut-off events. [2025-03-15 01:00:19,733 INFO L125 PetriNetUnfolderBase]: For 2422/2527 co-relation queries the response was YES. [2025-03-15 01:00:19,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2237 conditions, 525 events. 183/525 cut-off events. For 2422/2527 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2494 event pairs, 63 based on Foata normal form. 0/501 useless extension candidates. Maximal degree in co-relation 2016. Up to 268 conditions per place. [2025-03-15 01:00:19,737 INFO L140 encePairwiseOnDemand]: 133/136 looper letters, 35 selfloop transitions, 2 changer transitions 16/130 dead transitions. [2025-03-15 01:00:19,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 130 transitions, 766 flow [2025-03-15 01:00:19,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2025-03-15 01:00:19,739 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8235294117647058 [2025-03-15 01:00:19,739 INFO L298 CegarLoopForPetriNet]: 144 programPoint places, -8 predicate places. [2025-03-15 01:00:19,739 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 130 transitions, 766 flow [2025-03-15 01:00:19,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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 01:00:19,740 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:19,740 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:19,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:00:19,740 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread3Err0ASSERT_VIOLATIONDATA_RACE, thread3Err1ASSERT_VIOLATIONDATA_RACE, thread3Err2ASSERT_VIOLATIONDATA_RACE, thread3Err3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-03-15 01:00:19,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:19,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1472934931, now seen corresponding path program 1 times [2025-03-15 01:00:19,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:19,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476101503] [2025-03-15 01:00:19,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:19,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:19,795 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 01:00:19,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:19,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476101503] [2025-03-15 01:00:19,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476101503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:19,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:19,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:19,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135251848] [2025-03-15 01:00:19,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:19,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:19,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:19,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:19,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:19,797 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 136 [2025-03-15 01:00:19,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 130 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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 01:00:19,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:19,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 136 [2025-03-15 01:00:19,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:19,880 INFO L124 PetriNetUnfolderBase]: 191/526 cut-off events. [2025-03-15 01:00:19,880 INFO L125 PetriNetUnfolderBase]: For 3460/3584 co-relation queries the response was YES. [2025-03-15 01:00:19,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2546 conditions, 526 events. 191/526 cut-off events. For 3460/3584 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2476 event pairs, 47 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 2309. Up to 276 conditions per place. [2025-03-15 01:00:19,883 INFO L140 encePairwiseOnDemand]: 133/136 looper letters, 37 selfloop transitions, 2 changer transitions 16/133 dead transitions. [2025-03-15 01:00:19,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 133 transitions, 900 flow [2025-03-15 01:00:19,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2025-03-15 01:00:19,885 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8553921568627451 [2025-03-15 01:00:19,886 INFO L298 CegarLoopForPetriNet]: 144 programPoint places, -7 predicate places. [2025-03-15 01:00:19,886 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 133 transitions, 900 flow [2025-03-15 01:00:19,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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 01:00:19,886 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:19,886 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 01:00:19,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:00:19,886 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread3Err0ASSERT_VIOLATIONDATA_RACE, thread3Err1ASSERT_VIOLATIONDATA_RACE, thread3Err2ASSERT_VIOLATIONDATA_RACE, thread3Err3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-03-15 01:00:19,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:19,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2144522868, now seen corresponding path program 1 times [2025-03-15 01:00:19,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:19,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163740636] [2025-03-15 01:00:19,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:19,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:19,941 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 01:00:19,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:19,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163740636] [2025-03-15 01:00:19,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163740636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:19,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:19,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:19,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745714702] [2025-03-15 01:00:19,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:19,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:19,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:19,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:19,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:19,943 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 136 [2025-03-15 01:00:19,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 133 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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 01:00:19,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:19,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 136 [2025-03-15 01:00:19,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:20,041 INFO L124 PetriNetUnfolderBase]: 199/527 cut-off events. [2025-03-15 01:00:20,041 INFO L125 PetriNetUnfolderBase]: For 4752/4900 co-relation queries the response was YES. [2025-03-15 01:00:20,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2875 conditions, 527 events. 199/527 cut-off events. For 4752/4900 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2515 event pairs, 47 based on Foata normal form. 0/517 useless extension candidates. Maximal degree in co-relation 2618. Up to 277 conditions per place. [2025-03-15 01:00:20,044 INFO L140 encePairwiseOnDemand]: 133/136 looper letters, 0 selfloop transitions, 0 changer transitions 136/136 dead transitions. [2025-03-15 01:00:20,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 136 transitions, 1058 flow [2025-03-15 01:00:20,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:20,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2025-03-15 01:00:20,045 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.821078431372549 [2025-03-15 01:00:20,046 INFO L298 CegarLoopForPetriNet]: 144 programPoint places, -6 predicate places. [2025-03-15 01:00:20,046 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 136 transitions, 1058 flow [2025-03-15 01:00:20,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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 01:00:20,051 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-simple-equiv.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 01:00:20,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (22 of 23 remaining) [2025-03-15 01:00:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-03-15 01:00:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-03-15 01:00:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-03-15 01:00:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-03-15 01:00:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-03-15 01:00:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-03-15 01:00:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-03-15 01:00:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-03-15 01:00:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-03-15 01:00:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-03-15 01:00:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-03-15 01:00:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2025-03-15 01:00:20,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2025-03-15 01:00:20,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 23 remaining) [2025-03-15 01:00:20,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-03-15 01:00:20,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-03-15 01:00:20,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-03-15 01:00:20,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-03-15 01:00:20,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-03-15 01:00:20,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-03-15 01:00:20,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-03-15 01:00:20,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-03-15 01:00:20,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:00:20,076 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:00:20,084 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:00:20,085 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:00:20,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:00:20 BasicIcfg [2025-03-15 01:00:20,088 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:00:20,089 INFO L158 Benchmark]: Toolchain (without parser) took 2403.40ms. Allocated memory is still 100.7MB. Free memory was 73.1MB in the beginning and 20.8MB in the end (delta: 52.2MB). Peak memory consumption was 52.3MB. Max. memory is 8.0GB. [2025-03-15 01:00:20,089 INFO L158 Benchmark]: CDTParser took 1.17ms. Allocated memory is still 71.3MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:00:20,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.76ms. Allocated memory is still 100.7MB. Free memory was 73.1MB in the beginning and 61.8MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 01:00:20,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.41ms. Allocated memory is still 100.7MB. Free memory was 61.5MB in the beginning and 60.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:00:20,089 INFO L158 Benchmark]: Boogie Preprocessor took 23.80ms. Allocated memory is still 100.7MB. Free memory was 60.3MB in the beginning and 59.5MB in the end (delta: 753.7kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:00:20,089 INFO L158 Benchmark]: RCFGBuilder took 302.18ms. Allocated memory is still 100.7MB. Free memory was 59.5MB in the beginning and 45.6MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 01:00:20,090 INFO L158 Benchmark]: TraceAbstraction took 1849.14ms. Allocated memory is still 100.7MB. Free memory was 44.6MB in the beginning and 20.8MB in the end (delta: 23.8MB). Peak memory consumption was 22.9MB. Max. memory is 8.0GB. [2025-03-15 01:00:20,092 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 is still 33.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 190.76ms. Allocated memory is still 100.7MB. Free memory was 73.1MB in the beginning and 61.8MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.41ms. Allocated memory is still 100.7MB. Free memory was 61.5MB in the beginning and 60.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.80ms. Allocated memory is still 100.7MB. Free memory was 60.3MB in the beginning and 59.5MB in the end (delta: 753.7kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 302.18ms. Allocated memory is still 100.7MB. Free memory was 59.5MB in the beginning and 45.6MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 1849.14ms. Allocated memory is still 100.7MB. Free memory was 44.6MB in the beginning and 20.8MB in the end (delta: 23.8MB). Peak memory consumption was 22.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: 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: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 190 locations, 23 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.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 259 IncrementalHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 115 mSDtfsCounter, 259 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1058occurred in iteration=8, InterpolantAutomatonStates: 24, 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.3s InterpolantComputationTime, 439 NumberOfCodeBlocks, 439 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 431 ConstructedInterpolants, 0 QuantifiedInterpolants, 447 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:00:20,106 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...