/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.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:59:42,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:59:42,850 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:42,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:59:42,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:59:42,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:59:42,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:59:42,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:59:42,883 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:59:42,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:59:42,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:59:42,884 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:59:42,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:59:42,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:59:42,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:59:42,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:59:42,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:59:42,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:59:42,884 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:59:42,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:59:42,884 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:59:42,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:59:42,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:59:42,885 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:59:42,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:59:42,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:59:42,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:59:42,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:59:42,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:59:42,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:59:42,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:59:42,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:59:42,886 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:43,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:59:43,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:59:43,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:59:43,123 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:59:43,123 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:59:43,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2025-03-15 00:59:44,273 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae37a872/ea3d3faedb324aefbd919254d5ebdcc2/FLAGcf5514833 [2025-03-15 00:59:44,463 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:59:44,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2025-03-15 00:59:44,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae37a872/ea3d3faedb324aefbd919254d5ebdcc2/FLAGcf5514833 [2025-03-15 00:59:44,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae37a872/ea3d3faedb324aefbd919254d5ebdcc2 [2025-03-15 00:59:44,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:59:44,841 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:59:44,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:59:44,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:59:44,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:59:44,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:59:44" (1/1) ... [2025-03-15 00:59:44,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b6706c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:44, skipping insertion in model container [2025-03-15 00:59:44,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:59:44" (1/1) ... [2025-03-15 00:59:44,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:59:44,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:59:44,969 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:59:44,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:59:44,996 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:59:44,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:44 WrapperNode [2025-03-15 00:59:44,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:59:44,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:59:44,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:59:44,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:59:45,002 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:44" (1/1) ... [2025-03-15 00:59:45,007 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:44" (1/1) ... [2025-03-15 00:59:45,025 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 92 [2025-03-15 00:59:45,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:59:45,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:59:45,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:59:45,026 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:59:45,033 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:44" (1/1) ... [2025-03-15 00:59:45,033 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:44" (1/1) ... [2025-03-15 00:59:45,036 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:44" (1/1) ... [2025-03-15 00:59:45,036 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:44" (1/1) ... [2025-03-15 00:59:45,044 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:44" (1/1) ... [2025-03-15 00:59:45,045 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:44" (1/1) ... [2025-03-15 00:59:45,054 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:44" (1/1) ... [2025-03-15 00:59:45,055 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:44" (1/1) ... [2025-03-15 00:59:45,055 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:44" (1/1) ... [2025-03-15 00:59:45,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:59:45,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:59:45,057 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:59:45,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:59:45,063 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:44" (1/1) ... [2025-03-15 00:59:45,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:59:45,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:59:45,094 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:45,099 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:45,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:59:45,121 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 00:59:45,121 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 00:59:45,121 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 00:59:45,121 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 00:59:45,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:59:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:59:45,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:59:45,123 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:45,204 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:59:45,205 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:59:45,401 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:59:45,401 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:59:45,413 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:59:45,414 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-15 00:59:45,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:59:45 BoogieIcfgContainer [2025-03-15 00:59:45,414 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:59:45,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:59:45,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:59:45,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:59:45,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:59:44" (1/3) ... [2025-03-15 00:59:45,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e87cc5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:59:45, skipping insertion in model container [2025-03-15 00:59:45,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:44" (2/3) ... [2025-03-15 00:59:45,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e87cc5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:59:45, skipping insertion in model container [2025-03-15 00:59:45,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:59:45" (3/3) ... [2025-03-15 00:59:45,421 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2025-03-15 00:59:45,430 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:59:45,432 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2.wvr.c that has 3 procedures, 184 locations, 1 initial locations, 2 loop locations, and 21 error locations. [2025-03-15 00:59:45,432 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:59:45,496 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 00:59:45,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:59:45,549 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;@350a48c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:59:45,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-03-15 00:59:45,577 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:59:45,577 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-15 00:59:45,579 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:59:45,579 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:45,579 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] [2025-03-15 00:59:45,582 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-15 00:59:45,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:45,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1149660300, now seen corresponding path program 1 times [2025-03-15 00:59:45,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:45,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304536730] [2025-03-15 00:59:45,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:45,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:45,700 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,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:45,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304536730] [2025-03-15 00:59:45,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304536730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:45,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:45,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:45,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405284133] [2025-03-15 00:59:45,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:45,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:45,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:45,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:45,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:45,739 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 192 [2025-03-15 00:59:45,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 192 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:45,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 192 [2025-03-15 00:59:45,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:45,827 INFO L124 PetriNetUnfolderBase]: 18/229 cut-off events. [2025-03-15 00:59:45,827 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-15 00:59:45,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 229 events. 18/229 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 581 event pairs, 11 based on Foata normal form. 16/206 useless extension candidates. Maximal degree in co-relation 196. Up to 45 conditions per place. [2025-03-15 00:59:45,839 INFO L140 encePairwiseOnDemand]: 184/192 looper letters, 20 selfloop transitions, 2 changer transitions 10/178 dead transitions. [2025-03-15 00:59:45,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 178 transitions, 414 flow [2025-03-15 00:59:45,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2025-03-15 00:59:45,850 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8940972222222222 [2025-03-15 00:59:45,852 INFO L298 CegarLoopForPetriNet]: 190 programPoint places, -8 predicate places. [2025-03-15 00:59:45,852 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 178 transitions, 414 flow [2025-03-15 00:59:45,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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,853 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:45,853 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:45,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:59:45,853 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-15 00:59:45,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:45,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1056330807, now seen corresponding path program 1 times [2025-03-15 00:59:45,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:45,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844927902] [2025-03-15 00:59:45,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:45,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:45,901 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,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:45,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844927902] [2025-03-15 00:59:45,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844927902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:45,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:45,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:45,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427827218] [2025-03-15 00:59:45,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:45,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:45,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:45,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:45,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:45,904 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 192 [2025-03-15 00:59:45,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 178 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:45,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 192 [2025-03-15 00:59:45,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:46,020 INFO L124 PetriNetUnfolderBase]: 51/369 cut-off events. [2025-03-15 00:59:46,021 INFO L125 PetriNetUnfolderBase]: For 142/196 co-relation queries the response was YES. [2025-03-15 00:59:46,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 369 events. 51/369 cut-off events. For 142/196 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1647 event pairs, 38 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 371. Up to 92 conditions per place. [2025-03-15 00:59:46,025 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 20 selfloop transitions, 2 changer transitions 10/177 dead transitions. [2025-03-15 00:59:46,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 177 transitions, 458 flow [2025-03-15 00:59:46,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2025-03-15 00:59:46,027 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8854166666666666 [2025-03-15 00:59:46,028 INFO L298 CegarLoopForPetriNet]: 190 programPoint places, -7 predicate places. [2025-03-15 00:59:46,028 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 177 transitions, 458 flow [2025-03-15 00:59:46,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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:46,028 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:46,028 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:46,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:59:46,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-15 00:59:46,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:46,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2097379152, now seen corresponding path program 1 times [2025-03-15 00:59:46,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:46,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683927346] [2025-03-15 00:59:46,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:46,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:46,064 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:46,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:46,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683927346] [2025-03-15 00:59:46,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683927346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:46,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:46,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:46,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064627432] [2025-03-15 00:59:46,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:46,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:46,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:46,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:46,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:46,066 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 192 [2025-03-15 00:59:46,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 177 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 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:46,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:46,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 192 [2025-03-15 00:59:46,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:46,149 INFO L124 PetriNetUnfolderBase]: 87/521 cut-off events. [2025-03-15 00:59:46,149 INFO L125 PetriNetUnfolderBase]: For 358/367 co-relation queries the response was YES. [2025-03-15 00:59:46,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 521 events. 87/521 cut-off events. For 358/367 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2657 event pairs, 59 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 666. Up to 140 conditions per place. [2025-03-15 00:59:46,153 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 14 selfloop transitions, 2 changer transitions 10/176 dead transitions. [2025-03-15 00:59:46,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 176 transitions, 490 flow [2025-03-15 00:59:46,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:46,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:46,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2025-03-15 00:59:46,156 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.90625 [2025-03-15 00:59:46,156 INFO L298 CegarLoopForPetriNet]: 190 programPoint places, -6 predicate places. [2025-03-15 00:59:46,156 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 176 transitions, 490 flow [2025-03-15 00:59:46,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 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:46,157 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:46,157 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] [2025-03-15 00:59:46,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:59:46,157 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-15 00:59:46,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:46,158 INFO L85 PathProgramCache]: Analyzing trace with hash -730082184, now seen corresponding path program 1 times [2025-03-15 00:59:46,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:46,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955988775] [2025-03-15 00:59:46,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:46,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:46,201 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:46,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:46,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955988775] [2025-03-15 00:59:46,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955988775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:46,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:46,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:46,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739078685] [2025-03-15 00:59:46,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:46,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:46,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:46,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:46,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:46,203 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 192 [2025-03-15 00:59:46,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 176 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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:46,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:46,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 192 [2025-03-15 00:59:46,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:46,292 INFO L124 PetriNetUnfolderBase]: 96/529 cut-off events. [2025-03-15 00:59:46,292 INFO L125 PetriNetUnfolderBase]: For 1012/1102 co-relation queries the response was YES. [2025-03-15 00:59:46,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 529 events. 96/529 cut-off events. For 1012/1102 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2761 event pairs, 68 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 799. Up to 149 conditions per place. [2025-03-15 00:59:46,297 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 17 selfloop transitions, 2 changer transitions 10/175 dead transitions. [2025-03-15 00:59:46,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 175 transitions, 528 flow [2025-03-15 00:59:46,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:46,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:46,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2025-03-15 00:59:46,299 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8958333333333334 [2025-03-15 00:59:46,299 INFO L298 CegarLoopForPetriNet]: 190 programPoint places, -5 predicate places. [2025-03-15 00:59:46,300 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 175 transitions, 528 flow [2025-03-15 00:59:46,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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:46,300 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:46,300 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] [2025-03-15 00:59:46,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:59:46,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-15 00:59:46,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:46,301 INFO L85 PathProgramCache]: Analyzing trace with hash -436061472, now seen corresponding path program 1 times [2025-03-15 00:59:46,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:46,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995547694] [2025-03-15 00:59:46,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:46,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:46,351 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:46,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:46,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995547694] [2025-03-15 00:59:46,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995547694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:46,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:46,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:46,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989470538] [2025-03-15 00:59:46,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:46,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:46,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:46,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:46,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:46,353 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 192 [2025-03-15 00:59:46,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 175 transitions, 528 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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:46,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:46,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 192 [2025-03-15 00:59:46,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:46,426 INFO L124 PetriNetUnfolderBase]: 123/555 cut-off events. [2025-03-15 00:59:46,427 INFO L125 PetriNetUnfolderBase]: For 2620/2789 co-relation queries the response was YES. [2025-03-15 00:59:46,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1393 conditions, 555 events. 123/555 cut-off events. For 2620/2789 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3060 event pairs, 95 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 1019. Up to 176 conditions per place. [2025-03-15 00:59:46,433 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 17 selfloop transitions, 2 changer transitions 10/174 dead transitions. [2025-03-15 00:59:46,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 174 transitions, 566 flow [2025-03-15 00:59:46,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:46,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:46,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2025-03-15 00:59:46,436 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8958333333333334 [2025-03-15 00:59:46,437 INFO L298 CegarLoopForPetriNet]: 190 programPoint places, -4 predicate places. [2025-03-15 00:59:46,437 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 174 transitions, 566 flow [2025-03-15 00:59:46,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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:46,438 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:46,438 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:46,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:59:46,438 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-15 00:59:46,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:46,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1398972453, now seen corresponding path program 1 times [2025-03-15 00:59:46,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:46,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441999959] [2025-03-15 00:59:46,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:46,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:46,477 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:46,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:46,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441999959] [2025-03-15 00:59:46,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441999959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:46,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:46,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:46,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283363912] [2025-03-15 00:59:46,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:46,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:46,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:46,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:46,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:46,479 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 192 [2025-03-15 00:59:46,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 174 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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:46,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:46,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 192 [2025-03-15 00:59:46,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:46,569 INFO L124 PetriNetUnfolderBase]: 121/549 cut-off events. [2025-03-15 00:59:46,569 INFO L125 PetriNetUnfolderBase]: For 3848/4026 co-relation queries the response was YES. [2025-03-15 00:59:46,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1491 conditions, 549 events. 121/549 cut-off events. For 3848/4026 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3012 event pairs, 90 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 1087. Up to 174 conditions per place. [2025-03-15 00:59:46,572 INFO L140 encePairwiseOnDemand]: 186/192 looper letters, 15 selfloop transitions, 3 changer transitions 10/173 dead transitions. [2025-03-15 00:59:46,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 173 transitions, 611 flow [2025-03-15 00:59:46,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2025-03-15 00:59:46,574 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2025-03-15 00:59:46,574 INFO L298 CegarLoopForPetriNet]: 190 programPoint places, -5 predicate places. [2025-03-15 00:59:46,574 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 173 transitions, 611 flow [2025-03-15 00:59:46,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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:46,575 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:46,575 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:46,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:59:46,575 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-15 00:59:46,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:46,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1544813811, now seen corresponding path program 1 times [2025-03-15 00:59:46,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:46,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594452377] [2025-03-15 00:59:46,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:46,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:46,618 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:46,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:46,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594452377] [2025-03-15 00:59:46,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594452377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:46,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:46,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:46,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941332271] [2025-03-15 00:59:46,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:46,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:46,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:46,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:46,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:46,620 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 192 [2025-03-15 00:59:46,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 173 transitions, 611 flow. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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:46,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:46,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 192 [2025-03-15 00:59:46,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:46,697 INFO L124 PetriNetUnfolderBase]: 140/649 cut-off events. [2025-03-15 00:59:46,697 INFO L125 PetriNetUnfolderBase]: For 5062/5258 co-relation queries the response was YES. [2025-03-15 00:59:46,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1975 conditions, 649 events. 140/649 cut-off events. For 5062/5258 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3870 event pairs, 54 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 1133. Up to 187 conditions per place. [2025-03-15 00:59:46,701 INFO L140 encePairwiseOnDemand]: 186/192 looper letters, 21 selfloop transitions, 3 changer transitions 10/177 dead transitions. [2025-03-15 00:59:46,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 177 transitions, 749 flow [2025-03-15 00:59:46,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2025-03-15 00:59:46,702 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9097222222222222 [2025-03-15 00:59:46,703 INFO L298 CegarLoopForPetriNet]: 190 programPoint places, -6 predicate places. [2025-03-15 00:59:46,703 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 177 transitions, 749 flow [2025-03-15 00:59:46,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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:46,703 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:46,703 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:46,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:59:46,704 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-15 00:59:46,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:46,704 INFO L85 PathProgramCache]: Analyzing trace with hash -659389399, now seen corresponding path program 1 times [2025-03-15 00:59:46,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:46,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926632978] [2025-03-15 00:59:46,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:46,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:46,765 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:46,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:46,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926632978] [2025-03-15 00:59:46,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926632978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:46,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:46,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:46,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128265466] [2025-03-15 00:59:46,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:46,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:46,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:46,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:46,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:46,767 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 192 [2025-03-15 00:59:46,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 177 transitions, 749 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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:46,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:46,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 192 [2025-03-15 00:59:46,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:46,844 INFO L124 PetriNetUnfolderBase]: 134/601 cut-off events. [2025-03-15 00:59:46,844 INFO L125 PetriNetUnfolderBase]: For 7016/7250 co-relation queries the response was YES. [2025-03-15 00:59:46,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2052 conditions, 601 events. 134/601 cut-off events. For 7016/7250 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3439 event pairs, 15 based on Foata normal form. 0/526 useless extension candidates. Maximal degree in co-relation 1142. Up to 177 conditions per place. [2025-03-15 00:59:46,849 INFO L140 encePairwiseOnDemand]: 188/192 looper letters, 20 selfloop transitions, 2 changer transitions 10/179 dead transitions. [2025-03-15 00:59:46,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 179 transitions, 833 flow [2025-03-15 00:59:46,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 533 transitions. [2025-03-15 00:59:46,851 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9253472222222222 [2025-03-15 00:59:46,851 INFO L298 CegarLoopForPetriNet]: 190 programPoint places, -6 predicate places. [2025-03-15 00:59:46,851 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 179 transitions, 833 flow [2025-03-15 00:59:46,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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:46,852 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:46,852 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:46,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:59:46,852 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-15 00:59:46,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:46,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1311288106, now seen corresponding path program 1 times [2025-03-15 00:59:46,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:46,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605794613] [2025-03-15 00:59:46,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:46,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:46,895 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:46,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:46,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605794613] [2025-03-15 00:59:46,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605794613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:46,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:46,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:46,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971590183] [2025-03-15 00:59:46,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:46,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:46,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:46,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:46,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:46,897 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 192 [2025-03-15 00:59:46,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 179 transitions, 833 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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:46,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:46,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 192 [2025-03-15 00:59:46,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:46,961 INFO L124 PetriNetUnfolderBase]: 130/589 cut-off events. [2025-03-15 00:59:46,961 INFO L125 PetriNetUnfolderBase]: For 7395/7899 co-relation queries the response was YES. [2025-03-15 00:59:46,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2138 conditions, 589 events. 130/589 cut-off events. For 7395/7899 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3329 event pairs, 26 based on Foata normal form. 54/576 useless extension candidates. Maximal degree in co-relation 1191. Up to 173 conditions per place. [2025-03-15 00:59:46,965 INFO L140 encePairwiseOnDemand]: 188/192 looper letters, 23 selfloop transitions, 2 changer transitions 10/179 dead transitions. [2025-03-15 00:59:46,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 179 transitions, 919 flow [2025-03-15 00:59:46,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:46,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:46,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2025-03-15 00:59:46,967 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9114583333333334 [2025-03-15 00:59:46,967 INFO L298 CegarLoopForPetriNet]: 190 programPoint places, -6 predicate places. [2025-03-15 00:59:46,967 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 179 transitions, 919 flow [2025-03-15 00:59:46,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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:46,968 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:46,968 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:46,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:59:46,968 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-15 00:59:46,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:46,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1273156812, now seen corresponding path program 1 times [2025-03-15 00:59:46,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:46,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387055132] [2025-03-15 00:59:46,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:46,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:47,037 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:47,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:47,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387055132] [2025-03-15 00:59:47,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387055132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:47,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:47,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:47,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246120953] [2025-03-15 00:59:47,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:47,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:47,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:47,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:47,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:47,039 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 192 [2025-03-15 00:59:47,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 179 transitions, 919 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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:47,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:47,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 192 [2025-03-15 00:59:47,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:47,106 INFO L124 PetriNetUnfolderBase]: 124/571 cut-off events. [2025-03-15 00:59:47,106 INFO L125 PetriNetUnfolderBase]: For 6062/6326 co-relation queries the response was YES. [2025-03-15 00:59:47,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2206 conditions, 571 events. 124/571 cut-off events. For 6062/6326 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3121 event pairs, 20 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 1227. Up to 166 conditions per place. [2025-03-15 00:59:47,113 INFO L140 encePairwiseOnDemand]: 188/192 looper letters, 26 selfloop transitions, 2 changer transitions 10/180 dead transitions. [2025-03-15 00:59:47,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 180 transitions, 1032 flow [2025-03-15 00:59:47,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2025-03-15 00:59:47,115 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9149305555555556 [2025-03-15 00:59:47,115 INFO L298 CegarLoopForPetriNet]: 190 programPoint places, -6 predicate places. [2025-03-15 00:59:47,115 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 180 transitions, 1032 flow [2025-03-15 00:59:47,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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:47,116 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:47,116 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:47,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:59:47,116 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-15 00:59:47,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:47,116 INFO L85 PathProgramCache]: Analyzing trace with hash 939536307, now seen corresponding path program 1 times [2025-03-15 00:59:47,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:47,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551162971] [2025-03-15 00:59:47,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:47,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:47,171 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:47,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:47,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551162971] [2025-03-15 00:59:47,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551162971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:47,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:47,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:47,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165367792] [2025-03-15 00:59:47,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:47,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:47,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:47,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:47,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:47,173 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 192 [2025-03-15 00:59:47,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 180 transitions, 1032 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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:47,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:47,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 192 [2025-03-15 00:59:47,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:47,244 INFO L124 PetriNetUnfolderBase]: 126/569 cut-off events. [2025-03-15 00:59:47,244 INFO L125 PetriNetUnfolderBase]: For 7390/7814 co-relation queries the response was YES. [2025-03-15 00:59:47,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2366 conditions, 569 events. 126/569 cut-off events. For 7390/7814 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3094 event pairs, 20 based on Foata normal form. 0/518 useless extension candidates. Maximal degree in co-relation 1312. Up to 168 conditions per place. [2025-03-15 00:59:47,248 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 29 selfloop transitions, 2 changer transitions 10/181 dead transitions. [2025-03-15 00:59:47,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 181 transitions, 1140 flow [2025-03-15 00:59:47,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:47,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:47,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2025-03-15 00:59:47,250 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9010416666666666 [2025-03-15 00:59:47,250 INFO L298 CegarLoopForPetriNet]: 190 programPoint places, -5 predicate places. [2025-03-15 00:59:47,250 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 181 transitions, 1140 flow [2025-03-15 00:59:47,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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:47,250 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:47,250 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:47,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:59:47,251 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-15 00:59:47,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:47,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1753088667, now seen corresponding path program 1 times [2025-03-15 00:59:47,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:47,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894888293] [2025-03-15 00:59:47,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:47,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:47,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 00:59:47,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:47,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894888293] [2025-03-15 00:59:47,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894888293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:47,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:47,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:47,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544421774] [2025-03-15 00:59:47,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:47,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:47,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:47,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:47,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:47,303 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 192 [2025-03-15 00:59:47,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 181 transitions, 1140 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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:47,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:47,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 192 [2025-03-15 00:59:47,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:47,380 INFO L124 PetriNetUnfolderBase]: 129/566 cut-off events. [2025-03-15 00:59:47,381 INFO L125 PetriNetUnfolderBase]: For 9272/9718 co-relation queries the response was YES. [2025-03-15 00:59:47,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2550 conditions, 566 events. 129/566 cut-off events. For 9272/9718 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3104 event pairs, 18 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 1425. Up to 171 conditions per place. [2025-03-15 00:59:47,384 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 32 selfloop transitions, 2 changer transitions 10/183 dead transitions. [2025-03-15 00:59:47,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 183 transitions, 1279 flow [2025-03-15 00:59:47,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2025-03-15 00:59:47,386 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9045138888888888 [2025-03-15 00:59:47,387 INFO L298 CegarLoopForPetriNet]: 190 programPoint places, -4 predicate places. [2025-03-15 00:59:47,387 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 183 transitions, 1279 flow [2025-03-15 00:59:47,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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:47,388 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:47,388 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:47,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:59:47,388 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-15 00:59:47,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:47,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1827438360, now seen corresponding path program 1 times [2025-03-15 00:59:47,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:47,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145298851] [2025-03-15 00:59:47,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:47,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:47,431 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:47,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:47,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145298851] [2025-03-15 00:59:47,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145298851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:47,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:47,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:47,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039992947] [2025-03-15 00:59:47,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:47,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:47,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:47,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:47,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:47,432 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 192 [2025-03-15 00:59:47,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 183 transitions, 1279 flow. Second operand has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 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:47,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:47,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 192 [2025-03-15 00:59:47,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:47,497 INFO L124 PetriNetUnfolderBase]: 139/575 cut-off events. [2025-03-15 00:59:47,497 INFO L125 PetriNetUnfolderBase]: For 11937/12423 co-relation queries the response was YES. [2025-03-15 00:59:47,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2824 conditions, 575 events. 139/575 cut-off events. For 11937/12423 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3110 event pairs, 25 based on Foata normal form. 0/527 useless extension candidates. Maximal degree in co-relation 1513. Up to 180 conditions per place. [2025-03-15 00:59:47,502 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 37 selfloop transitions, 2 changer transitions 10/184 dead transitions. [2025-03-15 00:59:47,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 184 transitions, 1411 flow [2025-03-15 00:59:47,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:47,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2025-03-15 00:59:47,506 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2025-03-15 00:59:47,506 INFO L298 CegarLoopForPetriNet]: 190 programPoint places, -3 predicate places. [2025-03-15 00:59:47,506 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 184 transitions, 1411 flow [2025-03-15 00:59:47,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 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:47,507 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:47,507 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:47,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 00:59:47,507 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-15 00:59:47,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:47,507 INFO L85 PathProgramCache]: Analyzing trace with hash 2023927168, now seen corresponding path program 1 times [2025-03-15 00:59:47,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:47,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343392817] [2025-03-15 00:59:47,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:47,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:47,556 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:47,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:47,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343392817] [2025-03-15 00:59:47,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343392817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:47,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:47,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:47,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002076012] [2025-03-15 00:59:47,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:47,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:47,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:47,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:47,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:47,558 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 192 [2025-03-15 00:59:47,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 184 transitions, 1411 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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:47,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:47,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 192 [2025-03-15 00:59:47,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:47,636 INFO L124 PetriNetUnfolderBase]: 137/596 cut-off events. [2025-03-15 00:59:47,636 INFO L125 PetriNetUnfolderBase]: For 13493/13959 co-relation queries the response was YES. [2025-03-15 00:59:47,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3013 conditions, 596 events. 137/596 cut-off events. For 13493/13959 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3166 event pairs, 23 based on Foata normal form. 0/555 useless extension candidates. Maximal degree in co-relation 1714. Up to 171 conditions per place. [2025-03-15 00:59:47,639 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 0 selfloop transitions, 0 changer transitions 186/186 dead transitions. [2025-03-15 00:59:47,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 186 transitions, 1578 flow [2025-03-15 00:59:47,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:47,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2025-03-15 00:59:47,641 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8923611111111112 [2025-03-15 00:59:47,641 INFO L298 CegarLoopForPetriNet]: 190 programPoint places, -2 predicate places. [2025-03-15 00:59:47,641 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 186 transitions, 1578 flow [2025-03-15 00:59:47,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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:47,648 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-misc-2.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 00:59:47,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (36 of 37 remaining) [2025-03-15 00:59:47,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (35 of 37 remaining) [2025-03-15 00:59:47,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (34 of 37 remaining) [2025-03-15 00:59:47,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (33 of 37 remaining) [2025-03-15 00:59:47,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (32 of 37 remaining) [2025-03-15 00:59:47,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (31 of 37 remaining) [2025-03-15 00:59:47,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (30 of 37 remaining) [2025-03-15 00:59:47,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (29 of 37 remaining) [2025-03-15 00:59:47,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (28 of 37 remaining) [2025-03-15 00:59:47,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (27 of 37 remaining) [2025-03-15 00:59:47,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (26 of 37 remaining) [2025-03-15 00:59:47,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (25 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (24 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (23 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (20 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (18 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (13 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (12 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (11 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (10 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (9 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (8 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (7 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (4 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (2 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (1 of 37 remaining) [2025-03-15 00:59:47,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (0 of 37 remaining) [2025-03-15 00:59:47,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 00:59:47,672 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:47,675 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:59:47,675 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:59:47,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:59:47 BasicIcfg [2025-03-15 00:59:47,679 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:59:47,680 INFO L158 Benchmark]: Toolchain (without parser) took 2838.92ms. Allocated memory was 71.3MB in the beginning and 134.2MB in the end (delta: 62.9MB). Free memory was 44.5MB in the beginning and 56.3MB in the end (delta: -11.8MB). Peak memory consumption was 52.2MB. Max. memory is 8.0GB. [2025-03-15 00:59:47,680 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 71.3MB. Free memory was 32.7MB in the beginning and 32.7MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:59:47,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.50ms. Allocated memory is still 71.3MB. Free memory was 44.4MB in the beginning and 32.7MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-03-15 00:59:47,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.64ms. Allocated memory is still 71.3MB. Free memory was 32.6MB in the beginning and 31.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:59:47,680 INFO L158 Benchmark]: Boogie Preprocessor took 30.89ms. Allocated memory is still 71.3MB. Free memory was 31.3MB in the beginning and 30.3MB in the end (delta: 944.7kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:59:47,681 INFO L158 Benchmark]: RCFGBuilder took 356.77ms. Allocated memory is still 71.3MB. Free memory was 30.2MB in the beginning and 40.4MB in the end (delta: -10.2MB). Peak memory consumption was 15.2MB. Max. memory is 8.0GB. [2025-03-15 00:59:47,681 INFO L158 Benchmark]: TraceAbstraction took 2263.48ms. Allocated memory was 71.3MB in the beginning and 134.2MB in the end (delta: 62.9MB). Free memory was 39.2MB in the beginning and 56.3MB in the end (delta: -17.1MB). Peak memory consumption was 45.4MB. Max. memory is 8.0GB. [2025-03-15 00:59:47,684 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 71.3MB. Free memory was 32.7MB in the beginning and 32.7MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 155.50ms. Allocated memory is still 71.3MB. Free memory was 44.4MB in the beginning and 32.7MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.64ms. Allocated memory is still 71.3MB. Free memory was 32.6MB in the beginning and 31.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 30.89ms. Allocated memory is still 71.3MB. Free memory was 31.3MB in the beginning and 30.3MB in the end (delta: 944.7kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 356.77ms. Allocated memory is still 71.3MB. Free memory was 30.2MB in the beginning and 40.4MB in the end (delta: -10.2MB). Peak memory consumption was 15.2MB. Max. memory is 8.0GB. * TraceAbstraction took 2263.48ms. Allocated memory was 71.3MB in the beginning and 134.2MB in the end (delta: 62.9MB). Free memory was 39.2MB in the beginning and 56.3MB in the end (delta: -17.1MB). Peak memory consumption was 45.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: 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: 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: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: 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, 262 locations, 37 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 145 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 316 IncrementalHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 145 mSDtfsCounter, 316 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1578occurred in iteration=14, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 931 NumberOfCodeBlocks, 931 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 917 ConstructedInterpolants, 0 QuantifiedInterpolants, 945 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 00:59:47,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...