/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/fibonacci.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:59:08,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:59:08,711 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:08,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:59:08,766 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:59:08,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:59:08,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:59:08,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:59:08,775 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:59:08,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:59:08,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:59:08,778 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:59:08,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:59:08,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:59:08,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:59:08,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:59:08,779 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:59:08,779 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:59:08,779 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:59:08,779 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:59:08,779 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:59:08,779 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:59:08,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:59:08,779 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:59:08,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:59:08,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:59:08,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:59:08,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:59:08,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:59:08,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:59:08,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:59:08,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:59:08,780 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:09,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:59:09,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:59:09,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:59:09,019 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:59:09,019 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:59:09,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/fibonacci.wvr.c [2025-03-15 00:59:10,208 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4ae684ac/9b030ccbf0ed4ce58b2fe0570ddf7f16/FLAGe72d784f0 [2025-03-15 00:59:10,388 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:59:10,390 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/fibonacci.wvr.c [2025-03-15 00:59:10,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4ae684ac/9b030ccbf0ed4ce58b2fe0570ddf7f16/FLAGe72d784f0 [2025-03-15 00:59:10,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4ae684ac/9b030ccbf0ed4ce58b2fe0570ddf7f16 [2025-03-15 00:59:10,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:59:10,781 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:59:10,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:59:10,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:59:10,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:59:10,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:59:10" (1/1) ... [2025-03-15 00:59:10,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7172ab8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:10, skipping insertion in model container [2025-03-15 00:59:10,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:59:10" (1/1) ... [2025-03-15 00:59:10,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:59:10,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:59:10,915 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:59:10,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:59:10,944 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:59:10,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:10 WrapperNode [2025-03-15 00:59:10,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:59:10,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:59:10,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:59:10,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:59:10,949 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:10" (1/1) ... [2025-03-15 00:59:10,954 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:10" (1/1) ... [2025-03-15 00:59:10,970 INFO L138 Inliner]: procedures = 22, calls = 19, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 252 [2025-03-15 00:59:10,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:59:10,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:59:10,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:59:10,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:59:10,975 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:10" (1/1) ... [2025-03-15 00:59:10,976 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:10" (1/1) ... [2025-03-15 00:59:10,977 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:10" (1/1) ... [2025-03-15 00:59:10,977 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:10" (1/1) ... [2025-03-15 00:59:10,981 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:10" (1/1) ... [2025-03-15 00:59:10,982 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:10" (1/1) ... [2025-03-15 00:59:10,984 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:10" (1/1) ... [2025-03-15 00:59:10,985 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:10" (1/1) ... [2025-03-15 00:59:10,985 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:10" (1/1) ... [2025-03-15 00:59:10,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:59:10,987 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:59:10,987 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:59:10,987 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:59:10,988 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:10" (1/1) ... [2025-03-15 00:59:10,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:59:11,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:59:11,014 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:11,016 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:11,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:59:11,032 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 00:59:11,032 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 00:59:11,032 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 00:59:11,032 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 00:59:11,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:59:11,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:59:11,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:59:11,033 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:11,107 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:59:11,108 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:59:11,423 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:59:11,423 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:59:11,441 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:59:11,441 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-15 00:59:11,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:59:11 BoogieIcfgContainer [2025-03-15 00:59:11,442 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:59:11,445 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:59:11,445 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:59:11,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:59:11,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:59:10" (1/3) ... [2025-03-15 00:59:11,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2efee76a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:59:11, skipping insertion in model container [2025-03-15 00:59:11,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:10" (2/3) ... [2025-03-15 00:59:11,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2efee76a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:59:11, skipping insertion in model container [2025-03-15 00:59:11,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:59:11" (3/3) ... [2025-03-15 00:59:11,450 INFO L128 eAbstractionObserver]: Analyzing ICFG fibonacci.wvr.c [2025-03-15 00:59:11,461 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:59:11,462 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG fibonacci.wvr.c that has 3 procedures, 331 locations, 1 initial locations, 2 loop locations, and 31 error locations. [2025-03-15 00:59:11,463 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:59:11,553 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 00:59:11,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:59:11,620 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;@45b7b355, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:59:11,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2025-03-15 00:59:11,640 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:59:11,640 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-15 00:59:11,643 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:59:11,646 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:11,647 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:11,648 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-15 00:59:11,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:11,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1956609757, now seen corresponding path program 1 times [2025-03-15 00:59:11,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:11,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801722978] [2025-03-15 00:59:11,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:11,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:11,773 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:11,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:11,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801722978] [2025-03-15 00:59:11,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801722978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:11,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:11,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:11,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220869407] [2025-03-15 00:59:11,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:11,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:11,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:11,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:11,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:11,801 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 345 [2025-03-15 00:59:11,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 345 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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:11,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:11,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 345 [2025-03-15 00:59:11,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:11,994 INFO L124 PetriNetUnfolderBase]: 26/907 cut-off events. [2025-03-15 00:59:11,994 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-15 00:59:12,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 979 conditions, 907 events. 26/907 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4463 event pairs, 15 based on Foata normal form. 35/806 useless extension candidates. Maximal degree in co-relation 732. Up to 52 conditions per place. [2025-03-15 00:59:12,014 INFO L140 encePairwiseOnDemand]: 329/345 looper letters, 13 selfloop transitions, 2 changer transitions 10/323 dead transitions. [2025-03-15 00:59:12,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 323 transitions, 688 flow [2025-03-15 00:59:12,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:12,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 974 transitions. [2025-03-15 00:59:12,039 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9410628019323671 [2025-03-15 00:59:12,042 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, -8 predicate places. [2025-03-15 00:59:12,042 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 323 transitions, 688 flow [2025-03-15 00:59:12,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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:12,043 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:12,043 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:12,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:59:12,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-15 00:59:12,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:12,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1651898382, now seen corresponding path program 1 times [2025-03-15 00:59:12,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:12,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646590312] [2025-03-15 00:59:12,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:12,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:12,088 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:12,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:12,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646590312] [2025-03-15 00:59:12,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646590312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:12,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:12,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:12,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854943794] [2025-03-15 00:59:12,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:12,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:12,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:12,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:12,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:12,091 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 345 [2025-03-15 00:59:12,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 323 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 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:12,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:12,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 345 [2025-03-15 00:59:12,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:12,215 INFO L124 PetriNetUnfolderBase]: 38/918 cut-off events. [2025-03-15 00:59:12,215 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-03-15 00:59:12,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 918 events. 38/918 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4652 event pairs, 27 based on Foata normal form. 0/783 useless extension candidates. Maximal degree in co-relation 832. Up to 65 conditions per place. [2025-03-15 00:59:12,220 INFO L140 encePairwiseOnDemand]: 342/345 looper letters, 22 selfloop transitions, 2 changer transitions 10/322 dead transitions. [2025-03-15 00:59:12,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 322 transitions, 734 flow [2025-03-15 00:59:12,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 943 transitions. [2025-03-15 00:59:12,223 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9111111111111111 [2025-03-15 00:59:12,223 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, -7 predicate places. [2025-03-15 00:59:12,223 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 322 transitions, 734 flow [2025-03-15 00:59:12,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 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:12,224 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:12,224 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:12,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:59:12,224 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-15 00:59:12,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:12,225 INFO L85 PathProgramCache]: Analyzing trace with hash -204231247, now seen corresponding path program 1 times [2025-03-15 00:59:12,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:12,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3100389] [2025-03-15 00:59:12,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:12,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:12,273 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:12,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:12,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3100389] [2025-03-15 00:59:12,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3100389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:12,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:12,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:12,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470618329] [2025-03-15 00:59:12,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:12,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:12,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:12,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:12,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:12,275 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 345 [2025-03-15 00:59:12,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 322 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 310.3333333333333) internal successors, (931), 3 states have internal predecessors, (931), 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:12,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:12,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 345 [2025-03-15 00:59:12,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:12,452 INFO L124 PetriNetUnfolderBase]: 47/926 cut-off events. [2025-03-15 00:59:12,452 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2025-03-15 00:59:12,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1204 conditions, 926 events. 47/926 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4785 event pairs, 36 based on Foata normal form. 0/792 useless extension candidates. Maximal degree in co-relation 929. Up to 74 conditions per place. [2025-03-15 00:59:12,461 INFO L140 encePairwiseOnDemand]: 342/345 looper letters, 19 selfloop transitions, 2 changer transitions 10/321 dead transitions. [2025-03-15 00:59:12,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 321 transitions, 774 flow [2025-03-15 00:59:12,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:12,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 949 transitions. [2025-03-15 00:59:12,474 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9169082125603865 [2025-03-15 00:59:12,474 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, -6 predicate places. [2025-03-15 00:59:12,474 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 321 transitions, 774 flow [2025-03-15 00:59:12,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.3333333333333) internal successors, (931), 3 states have internal predecessors, (931), 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:12,475 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:12,475 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] [2025-03-15 00:59:12,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:59:12,475 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-15 00:59:12,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:12,476 INFO L85 PathProgramCache]: Analyzing trace with hash -70110731, now seen corresponding path program 1 times [2025-03-15 00:59:12,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:12,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994314987] [2025-03-15 00:59:12,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:12,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:12,548 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:12,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:12,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994314987] [2025-03-15 00:59:12,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994314987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:12,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:12,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:12,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155285327] [2025-03-15 00:59:12,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:12,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:12,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:12,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:12,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:12,551 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 345 [2025-03-15 00:59:12,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 321 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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:12,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:12,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 345 [2025-03-15 00:59:12,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:12,672 INFO L124 PetriNetUnfolderBase]: 50/928 cut-off events. [2025-03-15 00:59:12,672 INFO L125 PetriNetUnfolderBase]: For 356/356 co-relation queries the response was YES. [2025-03-15 00:59:12,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1273 conditions, 928 events. 50/928 cut-off events. For 356/356 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4806 event pairs, 39 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 984. Up to 77 conditions per place. [2025-03-15 00:59:12,678 INFO L140 encePairwiseOnDemand]: 342/345 looper letters, 13 selfloop transitions, 2 changer transitions 10/320 dead transitions. [2025-03-15 00:59:12,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 320 transitions, 802 flow [2025-03-15 00:59:12,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:12,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:12,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 961 transitions. [2025-03-15 00:59:12,680 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9285024154589372 [2025-03-15 00:59:12,681 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, -5 predicate places. [2025-03-15 00:59:12,681 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 320 transitions, 802 flow [2025-03-15 00:59:12,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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:12,682 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:12,682 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] [2025-03-15 00:59:12,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:59:12,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-15 00:59:12,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:12,683 INFO L85 PathProgramCache]: Analyzing trace with hash 31234967, now seen corresponding path program 1 times [2025-03-15 00:59:12,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:12,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72029007] [2025-03-15 00:59:12,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:12,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:12,741 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:12,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:12,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72029007] [2025-03-15 00:59:12,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72029007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:12,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:12,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:12,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833039943] [2025-03-15 00:59:12,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:12,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:12,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:12,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:12,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:12,744 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 345 [2025-03-15 00:59:12,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 320 transitions, 802 flow. Second operand has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 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:12,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:12,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 345 [2025-03-15 00:59:12,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:12,878 INFO L124 PetriNetUnfolderBase]: 62/939 cut-off events. [2025-03-15 00:59:12,878 INFO L125 PetriNetUnfolderBase]: For 2437/3012 co-relation queries the response was YES. [2025-03-15 00:59:12,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 939 events. 62/939 cut-off events. For 2437/3012 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5105 event pairs, 51 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 1060. Up to 113 conditions per place. [2025-03-15 00:59:12,884 INFO L140 encePairwiseOnDemand]: 342/345 looper letters, 22 selfloop transitions, 2 changer transitions 10/319 dead transitions. [2025-03-15 00:59:12,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 319 transitions, 848 flow [2025-03-15 00:59:12,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 943 transitions. [2025-03-15 00:59:12,886 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9111111111111111 [2025-03-15 00:59:12,887 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, -4 predicate places. [2025-03-15 00:59:12,887 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 319 transitions, 848 flow [2025-03-15 00:59:12,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 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:12,888 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:12,888 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] [2025-03-15 00:59:12,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:59:12,888 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-15 00:59:12,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:12,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1940152581, now seen corresponding path program 1 times [2025-03-15 00:59:12,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:12,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812252139] [2025-03-15 00:59:12,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:12,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:12,942 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:12,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:12,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812252139] [2025-03-15 00:59:12,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812252139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:12,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:12,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:12,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069726429] [2025-03-15 00:59:12,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:12,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:12,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:12,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:12,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:12,944 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 345 [2025-03-15 00:59:12,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 319 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 310.3333333333333) internal successors, (931), 3 states have internal predecessors, (931), 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:12,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:12,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 345 [2025-03-15 00:59:12,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:13,058 INFO L124 PetriNetUnfolderBase]: 71/947 cut-off events. [2025-03-15 00:59:13,059 INFO L125 PetriNetUnfolderBase]: For 8142/9767 co-relation queries the response was YES. [2025-03-15 00:59:13,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 947 events. 71/947 cut-off events. For 8142/9767 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5335 event pairs, 60 based on Foata normal form. 0/807 useless extension candidates. Maximal degree in co-relation 1124. Up to 122 conditions per place. [2025-03-15 00:59:13,064 INFO L140 encePairwiseOnDemand]: 342/345 looper letters, 19 selfloop transitions, 2 changer transitions 10/318 dead transitions. [2025-03-15 00:59:13,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 318 transitions, 888 flow [2025-03-15 00:59:13,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 949 transitions. [2025-03-15 00:59:13,066 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9169082125603865 [2025-03-15 00:59:13,066 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, -3 predicate places. [2025-03-15 00:59:13,066 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 318 transitions, 888 flow [2025-03-15 00:59:13,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.3333333333333) internal successors, (931), 3 states have internal predecessors, (931), 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:13,067 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:13,067 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] [2025-03-15 00:59:13,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:59:13,067 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-15 00:59:13,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:13,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1892230347, now seen corresponding path program 1 times [2025-03-15 00:59:13,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:13,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130050675] [2025-03-15 00:59:13,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:13,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:13,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:59:13,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:13,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130050675] [2025-03-15 00:59:13,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130050675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:13,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:13,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:13,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514373585] [2025-03-15 00:59:13,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:13,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:13,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:13,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:13,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:13,103 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 345 [2025-03-15 00:59:13,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 318 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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:13,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:13,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 345 [2025-03-15 00:59:13,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:13,206 INFO L124 PetriNetUnfolderBase]: 74/949 cut-off events. [2025-03-15 00:59:13,206 INFO L125 PetriNetUnfolderBase]: For 11342/13000 co-relation queries the response was YES. [2025-03-15 00:59:13,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1735 conditions, 949 events. 74/949 cut-off events. For 11342/13000 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5381 event pairs, 63 based on Foata normal form. 0/807 useless extension candidates. Maximal degree in co-relation 1164. Up to 125 conditions per place. [2025-03-15 00:59:13,212 INFO L140 encePairwiseOnDemand]: 342/345 looper letters, 12 selfloop transitions, 2 changer transitions 10/317 dead transitions. [2025-03-15 00:59:13,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 317 transitions, 916 flow [2025-03-15 00:59:13,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:13,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 961 transitions. [2025-03-15 00:59:13,214 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9285024154589372 [2025-03-15 00:59:13,215 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, -2 predicate places. [2025-03-15 00:59:13,215 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 317 transitions, 916 flow [2025-03-15 00:59:13,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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:13,216 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:13,216 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] [2025-03-15 00:59:13,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:59:13,216 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-15 00:59:13,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:13,216 INFO L85 PathProgramCache]: Analyzing trace with hash 370482835, now seen corresponding path program 1 times [2025-03-15 00:59:13,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:13,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103977062] [2025-03-15 00:59:13,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:13,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:13,253 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:13,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:13,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103977062] [2025-03-15 00:59:13,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103977062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:13,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:13,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:13,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264178312] [2025-03-15 00:59:13,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:13,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:13,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:13,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:13,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:13,256 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 345 [2025-03-15 00:59:13,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 317 transitions, 916 flow. Second operand has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 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:13,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:13,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 345 [2025-03-15 00:59:13,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:13,383 INFO L124 PetriNetUnfolderBase]: 71/936 cut-off events. [2025-03-15 00:59:13,383 INFO L125 PetriNetUnfolderBase]: For 9112/12303 co-relation queries the response was YES. [2025-03-15 00:59:13,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1772 conditions, 936 events. 71/936 cut-off events. For 9112/12303 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5301 event pairs, 57 based on Foata normal form. 12/816 useless extension candidates. Maximal degree in co-relation 1168. Up to 122 conditions per place. [2025-03-15 00:59:13,392 INFO L140 encePairwiseOnDemand]: 338/345 looper letters, 15 selfloop transitions, 3 changer transitions 10/314 dead transitions. [2025-03-15 00:59:13,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 314 transitions, 955 flow [2025-03-15 00:59:13,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:13,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:13,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2025-03-15 00:59:13,394 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9198067632850242 [2025-03-15 00:59:13,401 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, -4 predicate places. [2025-03-15 00:59:13,401 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 314 transitions, 955 flow [2025-03-15 00:59:13,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 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:13,402 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:13,402 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] [2025-03-15 00:59:13,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:59:13,402 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-15 00:59:13,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:13,403 INFO L85 PathProgramCache]: Analyzing trace with hash -448256987, now seen corresponding path program 1 times [2025-03-15 00:59:13,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:13,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996692308] [2025-03-15 00:59:13,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:13,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:13,459 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:13,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:13,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996692308] [2025-03-15 00:59:13,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996692308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:13,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:13,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:13,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029408280] [2025-03-15 00:59:13,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:13,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:13,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:13,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:13,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:13,462 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 345 [2025-03-15 00:59:13,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 314 transitions, 955 flow. Second operand has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 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:13,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:13,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 345 [2025-03-15 00:59:13,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:13,563 INFO L124 PetriNetUnfolderBase]: 68/917 cut-off events. [2025-03-15 00:59:13,563 INFO L125 PetriNetUnfolderBase]: For 9764/12145 co-relation queries the response was YES. [2025-03-15 00:59:13,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1812 conditions, 917 events. 68/917 cut-off events. For 9764/12145 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5058 event pairs, 51 based on Foata normal form. 0/803 useless extension candidates. Maximal degree in co-relation 1205. Up to 104 conditions per place. [2025-03-15 00:59:13,568 INFO L140 encePairwiseOnDemand]: 338/345 looper letters, 16 selfloop transitions, 3 changer transitions 10/311 dead transitions. [2025-03-15 00:59:13,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 311 transitions, 998 flow [2025-03-15 00:59:13,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2025-03-15 00:59:13,570 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9198067632850242 [2025-03-15 00:59:13,571 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, -6 predicate places. [2025-03-15 00:59:13,571 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 311 transitions, 998 flow [2025-03-15 00:59:13,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 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:13,572 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:13,572 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] [2025-03-15 00:59:13,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:59:13,572 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-15 00:59:13,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:13,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1285922, now seen corresponding path program 1 times [2025-03-15 00:59:13,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:13,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079549340] [2025-03-15 00:59:13,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:13,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:13,613 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:13,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:13,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079549340] [2025-03-15 00:59:13,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079549340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:13,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:13,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:13,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202868279] [2025-03-15 00:59:13,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:13,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:13,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:13,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:13,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:13,615 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 345 [2025-03-15 00:59:13,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 311 transitions, 998 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:13,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:13,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 345 [2025-03-15 00:59:13,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:13,772 INFO L124 PetriNetUnfolderBase]: 116/1504 cut-off events. [2025-03-15 00:59:13,772 INFO L125 PetriNetUnfolderBase]: For 17447/20823 co-relation queries the response was YES. [2025-03-15 00:59:13,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3105 conditions, 1504 events. 116/1504 cut-off events. For 17447/20823 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 10566 event pairs, 83 based on Foata normal form. 11/1323 useless extension candidates. Maximal degree in co-relation 1213. Up to 185 conditions per place. [2025-03-15 00:59:13,783 INFO L140 encePairwiseOnDemand]: 339/345 looper letters, 20 selfloop transitions, 3 changer transitions 10/314 dead transitions. [2025-03-15 00:59:13,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 314 transitions, 1151 flow [2025-03-15 00:59:13,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-03-15 00:59:13,785 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9294685990338164 [2025-03-15 00:59:13,786 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, -7 predicate places. [2025-03-15 00:59:13,786 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 314 transitions, 1151 flow [2025-03-15 00:59:13,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:13,786 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:13,786 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:13,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:59:13,786 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-15 00:59:13,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:13,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1235754375, now seen corresponding path program 1 times [2025-03-15 00:59:13,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:13,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893241158] [2025-03-15 00:59:13,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:13,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:13,831 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:13,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:13,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893241158] [2025-03-15 00:59:13,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893241158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:13,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:13,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:13,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480645035] [2025-03-15 00:59:13,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:13,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:13,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:13,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:13,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:13,833 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 345 [2025-03-15 00:59:13,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 314 transitions, 1151 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:13,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:13,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 345 [2025-03-15 00:59:13,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:14,108 INFO L124 PetriNetUnfolderBase]: 179/2004 cut-off events. [2025-03-15 00:59:14,109 INFO L125 PetriNetUnfolderBase]: For 39276/47976 co-relation queries the response was YES. [2025-03-15 00:59:14,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4545 conditions, 2004 events. 179/2004 cut-off events. For 39276/47976 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 14849 event pairs, 104 based on Foata normal form. 23/1783 useless extension candidates. Maximal degree in co-relation 1900. Up to 261 conditions per place. [2025-03-15 00:59:14,123 INFO L140 encePairwiseOnDemand]: 339/345 looper letters, 27 selfloop transitions, 3 changer transitions 10/319 dead transitions. [2025-03-15 00:59:14,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 319 transitions, 1378 flow [2025-03-15 00:59:14,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:14,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-03-15 00:59:14,126 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9294685990338164 [2025-03-15 00:59:14,127 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, -8 predicate places. [2025-03-15 00:59:14,127 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 319 transitions, 1378 flow [2025-03-15 00:59:14,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:14,127 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:14,127 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] [2025-03-15 00:59:14,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:59:14,128 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-15 00:59:14,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:14,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1855566788, now seen corresponding path program 1 times [2025-03-15 00:59:14,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:14,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395038189] [2025-03-15 00:59:14,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:14,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:14,185 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:14,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:14,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395038189] [2025-03-15 00:59:14,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395038189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:14,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:14,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:14,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818250955] [2025-03-15 00:59:14,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:14,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:14,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:14,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:14,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:14,187 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 345 [2025-03-15 00:59:14,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 319 transitions, 1378 flow. Second operand has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 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:14,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:14,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 345 [2025-03-15 00:59:14,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:14,365 INFO L124 PetriNetUnfolderBase]: 147/1739 cut-off events. [2025-03-15 00:59:14,365 INFO L125 PetriNetUnfolderBase]: For 49855/58224 co-relation queries the response was YES. [2025-03-15 00:59:14,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4236 conditions, 1739 events. 147/1739 cut-off events. For 49855/58224 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 12278 event pairs, 46 based on Foata normal form. 22/1583 useless extension candidates. Maximal degree in co-relation 1687. Up to 228 conditions per place. [2025-03-15 00:59:14,379 INFO L140 encePairwiseOnDemand]: 341/345 looper letters, 26 selfloop transitions, 2 changer transitions 10/321 dead transitions. [2025-03-15 00:59:14,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 321 transitions, 1488 flow [2025-03-15 00:59:14,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:14,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2025-03-15 00:59:14,381 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9391304347826087 [2025-03-15 00:59:14,382 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, -8 predicate places. [2025-03-15 00:59:14,382 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 321 transitions, 1488 flow [2025-03-15 00:59:14,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 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:14,383 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:14,383 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:14,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:59:14,383 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-15 00:59:14,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:14,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1960558686, now seen corresponding path program 1 times [2025-03-15 00:59:14,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:14,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945454069] [2025-03-15 00:59:14,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:14,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:14,413 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:14,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:14,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945454069] [2025-03-15 00:59:14,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945454069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:14,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:14,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:14,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487799292] [2025-03-15 00:59:14,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:14,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:14,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:14,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:14,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:14,415 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 345 [2025-03-15 00:59:14,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 321 transitions, 1488 flow. Second operand has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 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:14,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:14,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 345 [2025-03-15 00:59:14,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:14,582 INFO L124 PetriNetUnfolderBase]: 150/1737 cut-off events. [2025-03-15 00:59:14,582 INFO L125 PetriNetUnfolderBase]: For 59943/69940 co-relation queries the response was YES. [2025-03-15 00:59:14,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4443 conditions, 1737 events. 150/1737 cut-off events. For 59943/69940 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 12197 event pairs, 59 based on Foata normal form. 73/1640 useless extension candidates. Maximal degree in co-relation 1627. Up to 231 conditions per place. [2025-03-15 00:59:14,591 INFO L140 encePairwiseOnDemand]: 342/345 looper letters, 30 selfloop transitions, 2 changer transitions 10/323 dead transitions. [2025-03-15 00:59:14,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 323 transitions, 1635 flow [2025-03-15 00:59:14,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:14,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2025-03-15 00:59:14,593 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-03-15 00:59:14,593 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, -7 predicate places. [2025-03-15 00:59:14,593 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 323 transitions, 1635 flow [2025-03-15 00:59:14,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 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:14,593 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:14,594 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:14,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 00:59:14,594 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-15 00:59:14,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:14,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1326410867, now seen corresponding path program 1 times [2025-03-15 00:59:14,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:14,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567601722] [2025-03-15 00:59:14,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:14,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:14,628 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:14,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:14,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567601722] [2025-03-15 00:59:14,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567601722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:14,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:14,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:14,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176108191] [2025-03-15 00:59:14,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:14,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:14,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:14,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:14,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:14,630 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 345 [2025-03-15 00:59:14,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 323 transitions, 1635 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 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:14,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:14,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 345 [2025-03-15 00:59:14,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:14,781 INFO L124 PetriNetUnfolderBase]: 154/1725 cut-off events. [2025-03-15 00:59:14,781 INFO L125 PetriNetUnfolderBase]: For 70366/79276 co-relation queries the response was YES. [2025-03-15 00:59:14,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4674 conditions, 1725 events. 154/1725 cut-off events. For 70366/79276 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12153 event pairs, 53 based on Foata normal form. 24/1594 useless extension candidates. Maximal degree in co-relation 1847. Up to 235 conditions per place. [2025-03-15 00:59:14,796 INFO L140 encePairwiseOnDemand]: 342/345 looper letters, 33 selfloop transitions, 2 changer transitions 10/326 dead transitions. [2025-03-15 00:59:14,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 326 transitions, 1827 flow [2025-03-15 00:59:14,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:14,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:14,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2025-03-15 00:59:14,798 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-03-15 00:59:14,799 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, -6 predicate places. [2025-03-15 00:59:14,799 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 326 transitions, 1827 flow [2025-03-15 00:59:14,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 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:14,799 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:14,799 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:14,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 00:59:14,800 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-15 00:59:14,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:14,800 INFO L85 PathProgramCache]: Analyzing trace with hash -566141643, now seen corresponding path program 1 times [2025-03-15 00:59:14,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:14,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995885189] [2025-03-15 00:59:14,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:14,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:14,839 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:14,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:14,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995885189] [2025-03-15 00:59:14,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995885189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:14,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:14,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:14,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170744112] [2025-03-15 00:59:14,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:14,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:14,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:14,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:14,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:14,840 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 345 [2025-03-15 00:59:14,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 326 transitions, 1827 flow. Second operand has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 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:14,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:14,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 345 [2025-03-15 00:59:14,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:15,023 INFO L124 PetriNetUnfolderBase]: 156/1718 cut-off events. [2025-03-15 00:59:15,023 INFO L125 PetriNetUnfolderBase]: For 65520/78818 co-relation queries the response was YES. [2025-03-15 00:59:15,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4897 conditions, 1718 events. 156/1718 cut-off events. For 65520/78818 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12069 event pairs, 43 based on Foata normal form. 77/1647 useless extension candidates. Maximal degree in co-relation 1913. Up to 237 conditions per place. [2025-03-15 00:59:15,033 INFO L140 encePairwiseOnDemand]: 342/345 looper letters, 41 selfloop transitions, 2 changer transitions 10/327 dead transitions. [2025-03-15 00:59:15,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 327 transitions, 1973 flow [2025-03-15 00:59:15,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:15,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:15,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 944 transitions. [2025-03-15 00:59:15,035 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9120772946859903 [2025-03-15 00:59:15,036 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, -5 predicate places. [2025-03-15 00:59:15,036 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 327 transitions, 1973 flow [2025-03-15 00:59:15,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 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:15,036 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:15,036 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:15,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 00:59:15,037 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-15 00:59:15,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:15,037 INFO L85 PathProgramCache]: Analyzing trace with hash -563758481, now seen corresponding path program 1 times [2025-03-15 00:59:15,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:15,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587122386] [2025-03-15 00:59:15,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:15,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:15,067 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:15,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:15,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587122386] [2025-03-15 00:59:15,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587122386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:15,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:15,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:15,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224698633] [2025-03-15 00:59:15,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:15,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:15,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:15,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:15,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:15,069 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 345 [2025-03-15 00:59:15,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 327 transitions, 1973 flow. Second operand has 3 states, 3 states have (on average 311.6666666666667) internal successors, (935), 3 states have internal predecessors, (935), 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:15,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:15,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 345 [2025-03-15 00:59:15,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:15,257 INFO L124 PetriNetUnfolderBase]: 158/1719 cut-off events. [2025-03-15 00:59:15,257 INFO L125 PetriNetUnfolderBase]: For 80961/93953 co-relation queries the response was YES. [2025-03-15 00:59:15,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5158 conditions, 1719 events. 158/1719 cut-off events. For 80961/93953 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12089 event pairs, 68 based on Foata normal form. 25/1602 useless extension candidates. Maximal degree in co-relation 1837. Up to 231 conditions per place. [2025-03-15 00:59:15,266 INFO L140 encePairwiseOnDemand]: 342/345 looper letters, 43 selfloop transitions, 2 changer transitions 10/328 dead transitions. [2025-03-15 00:59:15,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 328 transitions, 2127 flow [2025-03-15 00:59:15,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:15,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:15,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 944 transitions. [2025-03-15 00:59:15,268 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9120772946859903 [2025-03-15 00:59:15,269 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, -4 predicate places. [2025-03-15 00:59:15,269 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 328 transitions, 2127 flow [2025-03-15 00:59:15,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 311.6666666666667) internal successors, (935), 3 states have internal predecessors, (935), 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:15,269 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:15,269 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:15,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 00:59:15,270 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-15 00:59:15,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:15,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1393275089, now seen corresponding path program 1 times [2025-03-15 00:59:15,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:15,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387051975] [2025-03-15 00:59:15,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:15,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:15,322 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:15,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:15,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387051975] [2025-03-15 00:59:15,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387051975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:15,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:15,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:15,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592755129] [2025-03-15 00:59:15,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:15,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:15,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:15,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:15,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:15,325 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 345 [2025-03-15 00:59:15,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 328 transitions, 2127 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 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:15,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:15,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 345 [2025-03-15 00:59:15,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:15,536 INFO L124 PetriNetUnfolderBase]: 158/1712 cut-off events. [2025-03-15 00:59:15,536 INFO L125 PetriNetUnfolderBase]: For 99112/113274 co-relation queries the response was YES. [2025-03-15 00:59:15,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5307 conditions, 1712 events. 158/1712 cut-off events. For 99112/113274 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12083 event pairs, 58 based on Foata normal form. 25/1600 useless extension candidates. Maximal degree in co-relation 1890. Up to 231 conditions per place. [2025-03-15 00:59:15,550 INFO L140 encePairwiseOnDemand]: 343/345 looper letters, 36 selfloop transitions, 1 changer transitions 10/327 dead transitions. [2025-03-15 00:59:15,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 327 transitions, 2195 flow [2025-03-15 00:59:15,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-03-15 00:59:15,552 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9352657004830918 [2025-03-15 00:59:15,552 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, -3 predicate places. [2025-03-15 00:59:15,552 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 327 transitions, 2195 flow [2025-03-15 00:59:15,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 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:15,553 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:15,553 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:15,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 00:59:15,553 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-15 00:59:15,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:15,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2088651913, now seen corresponding path program 1 times [2025-03-15 00:59:15,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:15,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366966391] [2025-03-15 00:59:15,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:15,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:15,597 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:15,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:15,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366966391] [2025-03-15 00:59:15,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366966391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:15,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:15,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:15,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490298716] [2025-03-15 00:59:15,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:15,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:15,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:15,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:15,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:15,599 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 345 [2025-03-15 00:59:15,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 327 transitions, 2195 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 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:15,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:15,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 345 [2025-03-15 00:59:15,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:15,773 INFO L124 PetriNetUnfolderBase]: 158/1708 cut-off events. [2025-03-15 00:59:15,773 INFO L125 PetriNetUnfolderBase]: For 120851/135117 co-relation queries the response was YES. [2025-03-15 00:59:15,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5469 conditions, 1708 events. 158/1708 cut-off events. For 120851/135117 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12035 event pairs, 58 based on Foata normal form. 25/1600 useless extension candidates. Maximal degree in co-relation 1953. Up to 231 conditions per place. [2025-03-15 00:59:15,787 INFO L140 encePairwiseOnDemand]: 343/345 looper letters, 27 selfloop transitions, 0 changer transitions 21/326 dead transitions. [2025-03-15 00:59:15,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 326 transitions, 2263 flow [2025-03-15 00:59:15,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:15,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:15,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-03-15 00:59:15,790 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9352657004830918 [2025-03-15 00:59:15,790 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, -2 predicate places. [2025-03-15 00:59:15,790 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 326 transitions, 2263 flow [2025-03-15 00:59:15,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 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:15,791 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:15,791 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 00:59:15,791 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-15 00:59:15,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:15,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1411204566, now seen corresponding path program 1 times [2025-03-15 00:59:15,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:15,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134732113] [2025-03-15 00:59:15,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:15,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:15,844 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:15,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:15,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134732113] [2025-03-15 00:59:15,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134732113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:15,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:15,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:15,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140046129] [2025-03-15 00:59:15,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:15,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:15,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:15,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:15,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:15,846 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 345 [2025-03-15 00:59:15,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 326 transitions, 2263 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:15,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:15,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 345 [2025-03-15 00:59:15,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:16,007 INFO L124 PetriNetUnfolderBase]: 160/1704 cut-off events. [2025-03-15 00:59:16,008 INFO L125 PetriNetUnfolderBase]: For 121946/140626 co-relation queries the response was YES. [2025-03-15 00:59:16,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5684 conditions, 1704 events. 160/1704 cut-off events. For 121946/140626 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12063 event pairs, 59 based on Foata normal form. 57/1634 useless extension candidates. Maximal degree in co-relation 2010. Up to 233 conditions per place. [2025-03-15 00:59:16,019 INFO L140 encePairwiseOnDemand]: 342/345 looper letters, 36 selfloop transitions, 2 changer transitions 21/327 dead transitions. [2025-03-15 00:59:16,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 327 transitions, 2431 flow [2025-03-15 00:59:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:16,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 951 transitions. [2025-03-15 00:59:16,021 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9188405797101449 [2025-03-15 00:59:16,022 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, -1 predicate places. [2025-03-15 00:59:16,022 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 327 transitions, 2431 flow [2025-03-15 00:59:16,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:16,022 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:16,022 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 00:59:16,022 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-15 00:59:16,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:16,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1941587612, now seen corresponding path program 1 times [2025-03-15 00:59:16,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:16,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387554251] [2025-03-15 00:59:16,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:16,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:16,062 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:16,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:16,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387554251] [2025-03-15 00:59:16,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387554251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:16,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:16,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:16,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289011756] [2025-03-15 00:59:16,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:16,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:16,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:16,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:16,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:16,063 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 345 [2025-03-15 00:59:16,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 327 transitions, 2431 flow. Second operand has 3 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 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:16,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:16,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 345 [2025-03-15 00:59:16,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:16,227 INFO L124 PetriNetUnfolderBase]: 162/1697 cut-off events. [2025-03-15 00:59:16,227 INFO L125 PetriNetUnfolderBase]: For 145495/163923 co-relation queries the response was YES. [2025-03-15 00:59:16,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5912 conditions, 1697 events. 162/1697 cut-off events. For 145495/163923 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 11951 event pairs, 51 based on Foata normal form. 27/1605 useless extension candidates. Maximal degree in co-relation 2302. Up to 235 conditions per place. [2025-03-15 00:59:16,237 INFO L140 encePairwiseOnDemand]: 342/345 looper letters, 0 selfloop transitions, 0 changer transitions 328/328 dead transitions. [2025-03-15 00:59:16,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 328 transitions, 2607 flow [2025-03-15 00:59:16,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:16,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:16,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 951 transitions. [2025-03-15 00:59:16,239 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9188405797101449 [2025-03-15 00:59:16,239 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, 0 predicate places. [2025-03-15 00:59:16,239 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 328 transitions, 2607 flow [2025-03-15 00:59:16,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 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:16,245 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/fibonacci.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 00:59:16,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (50 of 51 remaining) [2025-03-15 00:59:16,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2025-03-15 00:59:16,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2025-03-15 00:59:16,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2025-03-15 00:59:16,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2025-03-15 00:59:16,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2025-03-15 00:59:16,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2025-03-15 00:59:16,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2025-03-15 00:59:16,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2025-03-15 00:59:16,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2025-03-15 00:59:16,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2025-03-15 00:59:16,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (20 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2025-03-15 00:59:16,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2025-03-15 00:59:16,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2025-03-15 00:59:16,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2025-03-15 00:59:16,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2025-03-15 00:59:16,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2025-03-15 00:59:16,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2025-03-15 00:59:16,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2025-03-15 00:59:16,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2025-03-15 00:59:16,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2025-03-15 00:59:16,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2025-03-15 00:59:16,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2025-03-15 00:59:16,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2025-03-15 00:59:16,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2025-03-15 00:59:16,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2025-03-15 00:59:16,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2025-03-15 00:59:16,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2025-03-15 00:59:16,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 00:59:16,276 INFO L422 BasicCegarLoop]: Path program histogram: [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:16,280 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:59:16,280 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:59:16,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:59:16 BasicIcfg [2025-03-15 00:59:16,285 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:59:16,286 INFO L158 Benchmark]: Toolchain (without parser) took 5504.75ms. Allocated memory was 71.3MB in the beginning and 444.6MB in the end (delta: 373.3MB). Free memory was 44.3MB in the beginning and 135.1MB in the end (delta: -90.8MB). Peak memory consumption was 283.8MB. Max. memory is 8.0GB. [2025-03-15 00:59:16,287 INFO L158 Benchmark]: CDTParser took 1.15ms. Allocated memory is still 71.3MB. Free memory is still 36.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:59:16,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.71ms. Allocated memory is still 71.3MB. Free memory was 44.1MB in the beginning and 32.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 00:59:16,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.57ms. Allocated memory is still 71.3MB. Free memory was 32.0MB in the beginning and 30.1MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:59:16,288 INFO L158 Benchmark]: Boogie Preprocessor took 15.69ms. Allocated memory is still 71.3MB. Free memory was 30.1MB in the beginning and 28.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:59:16,288 INFO L158 Benchmark]: RCFGBuilder took 454.94ms. Allocated memory is still 71.3MB. Free memory was 28.8MB in the beginning and 32.3MB in the end (delta: -3.5MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. [2025-03-15 00:59:16,288 INFO L158 Benchmark]: TraceAbstraction took 4840.43ms. Allocated memory was 71.3MB in the beginning and 444.6MB in the end (delta: 373.3MB). Free memory was 31.1MB in the beginning and 135.1MB in the end (delta: -103.9MB). Peak memory consumption was 268.2MB. Max. memory is 8.0GB. [2025-03-15 00:59:16,289 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.15ms. Allocated memory is still 71.3MB. Free memory is still 36.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 162.71ms. Allocated memory is still 71.3MB. Free memory was 44.1MB in the beginning and 32.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.57ms. Allocated memory is still 71.3MB. Free memory was 32.0MB in the beginning and 30.1MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.69ms. Allocated memory is still 71.3MB. Free memory was 30.1MB in the beginning and 28.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 454.94ms. Allocated memory is still 71.3MB. Free memory was 28.8MB in the beginning and 32.3MB in the end (delta: -3.5MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4840.43ms. Allocated memory was 71.3MB in the beginning and 444.6MB in the end (delta: 373.3MB). Free memory was 31.1MB in the beginning and 135.1MB in the end (delta: -103.9MB). Peak memory consumption was 268.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: 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: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: 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: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: 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: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: 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: 76]: 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: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: 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, 525 locations, 51 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 216 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 379 IncrementalHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 216 mSDtfsCounter, 379 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2607occurred in iteration=20, InterpolantAutomatonStates: 60, 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.6s InterpolantComputationTime, 1791 NumberOfCodeBlocks, 1791 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1771 ConstructedInterpolants, 0 QuantifiedInterpolants, 1811 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 31 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 00:59:16,304 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...