/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/popl20-more-buffer-mult2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:02:50,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:02:50,482 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 01:02:50,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:02:50,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:02:50,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:02:50,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:02:50,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:02:50,501 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:02:50,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:02:50,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:02:50,502 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:02:50,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:02:50,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:02:50,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:02:50,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:02:50,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:02:50,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:02:50,502 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:02:50,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:02:50,502 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:02:50,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:02:50,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:02:50,502 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:02:50,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:02:50,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:02:50,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:02:50,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:02:50,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:02:50,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:02:50,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:02:50,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:02:50,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2025-03-15 01:02:50,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:02:50,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:02:50,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:02:50,766 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:02:50,766 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:02:50,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c [2025-03-15 01:02:51,963 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c3dd79ea/e716f914b66c4c51ade458043f7b61aa/FLAG6ac57eddb [2025-03-15 01:02:52,161 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:02:52,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult2.wvr.c [2025-03-15 01:02:52,171 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c3dd79ea/e716f914b66c4c51ade458043f7b61aa/FLAG6ac57eddb [2025-03-15 01:02:52,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c3dd79ea/e716f914b66c4c51ade458043f7b61aa [2025-03-15 01:02:52,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:02:52,189 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:02:52,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:02:52,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:02:52,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:02:52,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:02:52" (1/1) ... [2025-03-15 01:02:52,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@231944da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:52, skipping insertion in model container [2025-03-15 01:02:52,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:02:52" (1/1) ... [2025-03-15 01:02:52,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:02:52,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:02:52,384 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:02:52,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:02:52,445 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:02:52,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:52 WrapperNode [2025-03-15 01:02:52,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:02:52,448 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:02:52,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:02:52,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:02:52,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:52" (1/1) ... [2025-03-15 01:02:52,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:52" (1/1) ... [2025-03-15 01:02:52,498 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 556 [2025-03-15 01:02:52,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:02:52,499 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:02:52,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:02:52,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:02:52,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:52" (1/1) ... [2025-03-15 01:02:52,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:52" (1/1) ... [2025-03-15 01:02:52,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:52" (1/1) ... [2025-03-15 01:02:52,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:52" (1/1) ... [2025-03-15 01:02:52,529 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:52" (1/1) ... [2025-03-15 01:02:52,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:52" (1/1) ... [2025-03-15 01:02:52,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:52" (1/1) ... [2025-03-15 01:02:52,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:52" (1/1) ... [2025-03-15 01:02:52,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:52" (1/1) ... [2025-03-15 01:02:52,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:02:52,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:02:52,544 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:02:52,544 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:02:52,547 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:52" (1/1) ... [2025-03-15 01:02:52,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:02:52,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:02:52,573 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 01:02:52,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 01:02:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:02:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:02:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:02:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 01:02:52,594 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 01:02:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 01:02:52,594 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 01:02:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 01:02:52,594 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 01:02:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-15 01:02:52,594 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-15 01:02:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:02:52,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 01:02:52,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 01:02:52,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 01:02:52,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:02:52,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:02:52,597 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 01:02:52,720 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:02:52,722 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:02:53,308 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:02:53,308 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:02:53,701 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:02:53,701 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:02:53,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:02:53 BoogieIcfgContainer [2025-03-15 01:02:53,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:02:53,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:02:53,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:02:53,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:02:53,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:02:52" (1/3) ... [2025-03-15 01:02:53,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d980487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:02:53, skipping insertion in model container [2025-03-15 01:02:53,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:52" (2/3) ... [2025-03-15 01:02:53,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d980487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:02:53, skipping insertion in model container [2025-03-15 01:02:53,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:02:53" (3/3) ... [2025-03-15 01:02:53,710 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult2.wvr.c [2025-03-15 01:02:53,722 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:02:53,724 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult2.wvr.c that has 5 procedures, 369 locations, 1 initial locations, 6 loop locations, and 89 error locations. [2025-03-15 01:02:53,725 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:02:53,833 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-15 01:02:53,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:02:53,882 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;@d237e5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:02:53,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 163 error locations. [2025-03-15 01:02:53,907 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:02:53,908 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-03-15 01:02:53,912 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:02:53,912 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:53,912 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 01:02:53,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:53,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:53,917 INFO L85 PathProgramCache]: Analyzing trace with hash -33266128, now seen corresponding path program 1 times [2025-03-15 01:02:53,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:53,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828108586] [2025-03-15 01:02:53,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:53,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:02:54,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:54,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828108586] [2025-03-15 01:02:54,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828108586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:54,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:54,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:54,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101124559] [2025-03-15 01:02:54,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:54,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:54,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:54,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:54,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:54,103 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 381 [2025-03-15 01:02:54,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 381 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:54,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:54,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 381 [2025-03-15 01:02:54,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:54,452 INFO L124 PetriNetUnfolderBase]: 451/1157 cut-off events. [2025-03-15 01:02:54,452 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2025-03-15 01:02:54,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1899 conditions, 1157 events. 451/1157 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5141 event pairs, 272 based on Foata normal form. 7/1039 useless extension candidates. Maximal degree in co-relation 1525. Up to 615 conditions per place. [2025-03-15 01:02:54,470 INFO L140 encePairwiseOnDemand]: 301/381 looper letters, 26 selfloop transitions, 2 changer transitions 14/293 dead transitions. [2025-03-15 01:02:54,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 293 transitions, 666 flow [2025-03-15 01:02:54,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:54,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2025-03-15 01:02:54,488 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8118985126859143 [2025-03-15 01:02:54,492 INFO L298 CegarLoopForPetriNet]: 381 programPoint places, -80 predicate places. [2025-03-15 01:02:54,492 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 293 transitions, 666 flow [2025-03-15 01:02:54,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:54,493 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:54,494 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 01:02:54,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:02:54,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:54,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:54,495 INFO L85 PathProgramCache]: Analyzing trace with hash -119564433, now seen corresponding path program 1 times [2025-03-15 01:02:54,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:54,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105091445] [2025-03-15 01:02:54,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:54,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:54,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:02:54,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:54,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105091445] [2025-03-15 01:02:54,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105091445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:54,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:54,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:54,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569481338] [2025-03-15 01:02:54,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:54,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:54,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:54,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:54,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:54,562 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 381 [2025-03-15 01:02:54,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 293 transitions, 666 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:54,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:54,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 381 [2025-03-15 01:02:54,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:54,807 INFO L124 PetriNetUnfolderBase]: 451/1156 cut-off events. [2025-03-15 01:02:54,807 INFO L125 PetriNetUnfolderBase]: For 330/480 co-relation queries the response was YES. [2025-03-15 01:02:54,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2515 conditions, 1156 events. 451/1156 cut-off events. For 330/480 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5118 event pairs, 272 based on Foata normal form. 0/1032 useless extension candidates. Maximal degree in co-relation 2092. Up to 615 conditions per place. [2025-03-15 01:02:54,818 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 26 selfloop transitions, 2 changer transitions 14/292 dead transitions. [2025-03-15 01:02:54,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 292 transitions, 720 flow [2025-03-15 01:02:54,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:54,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2025-03-15 01:02:54,820 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7445319335083115 [2025-03-15 01:02:54,820 INFO L298 CegarLoopForPetriNet]: 381 programPoint places, -79 predicate places. [2025-03-15 01:02:54,821 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 292 transitions, 720 flow [2025-03-15 01:02:54,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:54,821 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:54,821 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 01:02:54,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:02:54,821 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:54,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:54,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1743467322, now seen corresponding path program 1 times [2025-03-15 01:02:54,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:54,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612652432] [2025-03-15 01:02:54,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:54,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:02:54,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:54,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612652432] [2025-03-15 01:02:54,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612652432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:54,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:54,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:54,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003817167] [2025-03-15 01:02:54,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:54,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:54,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:54,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:54,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:54,886 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 381 [2025-03-15 01:02:54,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 292 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:54,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:54,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 381 [2025-03-15 01:02:54,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:55,139 INFO L124 PetriNetUnfolderBase]: 451/1155 cut-off events. [2025-03-15 01:02:55,139 INFO L125 PetriNetUnfolderBase]: For 618/918 co-relation queries the response was YES. [2025-03-15 01:02:55,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3131 conditions, 1155 events. 451/1155 cut-off events. For 618/918 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5108 event pairs, 272 based on Foata normal form. 0/1032 useless extension candidates. Maximal degree in co-relation 2659. Up to 615 conditions per place. [2025-03-15 01:02:55,149 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 26 selfloop transitions, 2 changer transitions 14/291 dead transitions. [2025-03-15 01:02:55,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 291 transitions, 774 flow [2025-03-15 01:02:55,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:55,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2025-03-15 01:02:55,152 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7445319335083115 [2025-03-15 01:02:55,152 INFO L298 CegarLoopForPetriNet]: 381 programPoint places, -78 predicate places. [2025-03-15 01:02:55,152 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 291 transitions, 774 flow [2025-03-15 01:02:55,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:55,153 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:55,153 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 01:02:55,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:02:55,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:55,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:55,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1747344583, now seen corresponding path program 1 times [2025-03-15 01:02:55,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:55,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126529100] [2025-03-15 01:02:55,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:55,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:02:55,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:55,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126529100] [2025-03-15 01:02:55,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126529100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:55,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:55,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:55,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517039392] [2025-03-15 01:02:55,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:55,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:55,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:55,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:55,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:55,224 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 381 [2025-03-15 01:02:55,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 291 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:55,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:55,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 381 [2025-03-15 01:02:55,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:55,449 INFO L124 PetriNetUnfolderBase]: 451/1154 cut-off events. [2025-03-15 01:02:55,449 INFO L125 PetriNetUnfolderBase]: For 1022/1472 co-relation queries the response was YES. [2025-03-15 01:02:55,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3747 conditions, 1154 events. 451/1154 cut-off events. For 1022/1472 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5093 event pairs, 272 based on Foata normal form. 0/1032 useless extension candidates. Maximal degree in co-relation 3226. Up to 615 conditions per place. [2025-03-15 01:02:55,460 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 26 selfloop transitions, 2 changer transitions 14/290 dead transitions. [2025-03-15 01:02:55,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 290 transitions, 828 flow [2025-03-15 01:02:55,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:55,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:55,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2025-03-15 01:02:55,463 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7445319335083115 [2025-03-15 01:02:55,464 INFO L298 CegarLoopForPetriNet]: 381 programPoint places, -77 predicate places. [2025-03-15 01:02:55,464 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 290 transitions, 828 flow [2025-03-15 01:02:55,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:55,465 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:55,465 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 01:02:55,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:02:55,466 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:55,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:55,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1409392285, now seen corresponding path program 1 times [2025-03-15 01:02:55,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:55,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132421519] [2025-03-15 01:02:55,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:55,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:55,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:02:55,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:55,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132421519] [2025-03-15 01:02:55,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132421519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:55,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:55,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:55,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855559850] [2025-03-15 01:02:55,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:55,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:55,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:55,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:55,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:55,525 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 381 [2025-03-15 01:02:55,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 290 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:55,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:55,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 381 [2025-03-15 01:02:55,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:55,741 INFO L124 PetriNetUnfolderBase]: 451/1153 cut-off events. [2025-03-15 01:02:55,741 INFO L125 PetriNetUnfolderBase]: For 1542/2142 co-relation queries the response was YES. [2025-03-15 01:02:55,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4363 conditions, 1153 events. 451/1153 cut-off events. For 1542/2142 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5127 event pairs, 272 based on Foata normal form. 0/1032 useless extension candidates. Maximal degree in co-relation 3793. Up to 615 conditions per place. [2025-03-15 01:02:55,749 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 26 selfloop transitions, 2 changer transitions 14/289 dead transitions. [2025-03-15 01:02:55,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 289 transitions, 882 flow [2025-03-15 01:02:55,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:55,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2025-03-15 01:02:55,751 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7445319335083115 [2025-03-15 01:02:55,751 INFO L298 CegarLoopForPetriNet]: 381 programPoint places, -76 predicate places. [2025-03-15 01:02:55,751 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 289 transitions, 882 flow [2025-03-15 01:02:55,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:55,752 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:55,752 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] [2025-03-15 01:02:55,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:02:55,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:55,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:55,754 INFO L85 PathProgramCache]: Analyzing trace with hash -600432898, now seen corresponding path program 1 times [2025-03-15 01:02:55,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:55,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445858316] [2025-03-15 01:02:55,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:55,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:55,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:02:55,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:55,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445858316] [2025-03-15 01:02:55,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445858316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:55,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:55,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:55,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981636172] [2025-03-15 01:02:55,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:55,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:55,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:55,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:55,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:55,814 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 381 [2025-03-15 01:02:55,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 289 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:55,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:55,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 381 [2025-03-15 01:02:55,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:56,050 INFO L124 PetriNetUnfolderBase]: 595/1548 cut-off events. [2025-03-15 01:02:56,050 INFO L125 PetriNetUnfolderBase]: For 3223/4043 co-relation queries the response was YES. [2025-03-15 01:02:56,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6580 conditions, 1548 events. 595/1548 cut-off events. For 3223/4043 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8257 event pairs, 228 based on Foata normal form. 0/1384 useless extension candidates. Maximal degree in co-relation 5884. Up to 811 conditions per place. [2025-03-15 01:02:56,061 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 37 selfloop transitions, 2 changer transitions 14/303 dead transitions. [2025-03-15 01:02:56,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 303 transitions, 1151 flow [2025-03-15 01:02:56,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:56,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 874 transitions. [2025-03-15 01:02:56,064 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7646544181977253 [2025-03-15 01:02:56,064 INFO L298 CegarLoopForPetriNet]: 381 programPoint places, -75 predicate places. [2025-03-15 01:02:56,064 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 303 transitions, 1151 flow [2025-03-15 01:02:56,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:56,065 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:56,065 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 01:02:56,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:02:56,065 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:56,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:56,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1999637522, now seen corresponding path program 1 times [2025-03-15 01:02:56,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:56,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808289664] [2025-03-15 01:02:56,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:56,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:02:56,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:56,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808289664] [2025-03-15 01:02:56,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808289664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:56,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:56,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:56,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161381308] [2025-03-15 01:02:56,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:56,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:56,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:56,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:56,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:56,102 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 381 [2025-03-15 01:02:56,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 303 transitions, 1151 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:56,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:56,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 381 [2025-03-15 01:02:56,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:56,350 INFO L124 PetriNetUnfolderBase]: 595/1534 cut-off events. [2025-03-15 01:02:56,351 INFO L125 PetriNetUnfolderBase]: For 4002/4902 co-relation queries the response was YES. [2025-03-15 01:02:56,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7376 conditions, 1534 events. 595/1534 cut-off events. For 4002/4902 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7981 event pairs, 171 based on Foata normal form. 0/1370 useless extension candidates. Maximal degree in co-relation 6627. Up to 811 conditions per place. [2025-03-15 01:02:56,369 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 38 selfloop transitions, 2 changer transitions 14/302 dead transitions. [2025-03-15 01:02:56,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 302 transitions, 1229 flow [2025-03-15 01:02:56,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-03-15 01:02:56,373 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7497812773403325 [2025-03-15 01:02:56,374 INFO L298 CegarLoopForPetriNet]: 381 programPoint places, -74 predicate places. [2025-03-15 01:02:56,374 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 302 transitions, 1229 flow [2025-03-15 01:02:56,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:56,375 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:56,375 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] [2025-03-15 01:02:56,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:02:56,375 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:56,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:56,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1103780779, now seen corresponding path program 1 times [2025-03-15 01:02:56,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:56,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285751127] [2025-03-15 01:02:56,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:56,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:02:56,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:56,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285751127] [2025-03-15 01:02:56,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285751127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:56,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:56,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:56,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148708965] [2025-03-15 01:02:56,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:56,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:56,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:56,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:56,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:56,429 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 381 [2025-03-15 01:02:56,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 302 transitions, 1229 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:56,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:56,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 381 [2025-03-15 01:02:56,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:56,692 INFO L124 PetriNetUnfolderBase]: 595/1533 cut-off events. [2025-03-15 01:02:56,693 INFO L125 PetriNetUnfolderBase]: For 5214/6354 co-relation queries the response was YES. [2025-03-15 01:02:56,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8188 conditions, 1533 events. 595/1533 cut-off events. For 5214/6354 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8016 event pairs, 171 based on Foata normal form. 0/1370 useless extension candidates. Maximal degree in co-relation 7383. Up to 811 conditions per place. [2025-03-15 01:02:56,706 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 41 selfloop transitions, 2 changer transitions 14/301 dead transitions. [2025-03-15 01:02:56,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 301 transitions, 1313 flow [2025-03-15 01:02:56,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:56,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:56,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2025-03-15 01:02:56,708 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7445319335083115 [2025-03-15 01:02:56,711 INFO L298 CegarLoopForPetriNet]: 381 programPoint places, -73 predicate places. [2025-03-15 01:02:56,711 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 301 transitions, 1313 flow [2025-03-15 01:02:56,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:56,712 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:56,712 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] [2025-03-15 01:02:56,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:02:56,712 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:56,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:56,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1543373693, now seen corresponding path program 1 times [2025-03-15 01:02:56,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:56,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374986642] [2025-03-15 01:02:56,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:56,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:02:56,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:56,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374986642] [2025-03-15 01:02:56,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374986642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:56,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:56,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:56,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296810653] [2025-03-15 01:02:56,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:56,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:56,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:56,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:56,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:56,751 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 381 [2025-03-15 01:02:56,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 301 transitions, 1313 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:56,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:56,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 381 [2025-03-15 01:02:56,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:57,076 INFO L124 PetriNetUnfolderBase]: 749/1909 cut-off events. [2025-03-15 01:02:57,076 INFO L125 PetriNetUnfolderBase]: For 8404/9928 co-relation queries the response was YES. [2025-03-15 01:02:57,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11282 conditions, 1909 events. 749/1909 cut-off events. For 8404/9928 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10860 event pairs, 156 based on Foata normal form. 0/1714 useless extension candidates. Maximal degree in co-relation 10332. Up to 1021 conditions per place. [2025-03-15 01:02:57,093 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 62 selfloop transitions, 3 changer transitions 14/326 dead transitions. [2025-03-15 01:02:57,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 326 transitions, 1931 flow [2025-03-15 01:02:57,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 873 transitions. [2025-03-15 01:02:57,095 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7637795275590551 [2025-03-15 01:02:57,096 INFO L298 CegarLoopForPetriNet]: 381 programPoint places, -72 predicate places. [2025-03-15 01:02:57,096 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 326 transitions, 1931 flow [2025-03-15 01:02:57,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:57,096 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:57,096 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] [2025-03-15 01:02:57,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:02:57,097 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:57,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:57,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1630438883, now seen corresponding path program 1 times [2025-03-15 01:02:57,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:57,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61539595] [2025-03-15 01:02:57,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:57,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:57,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:02:57,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:57,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61539595] [2025-03-15 01:02:57,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61539595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:57,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:57,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:57,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310676394] [2025-03-15 01:02:57,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:57,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:57,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:57,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:57,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:57,139 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 381 [2025-03-15 01:02:57,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 326 transitions, 1931 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:57,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:57,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 381 [2025-03-15 01:02:57,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:57,408 INFO L124 PetriNetUnfolderBase]: 749/1855 cut-off events. [2025-03-15 01:02:57,408 INFO L125 PetriNetUnfolderBase]: For 9181/10855 co-relation queries the response was YES. [2025-03-15 01:02:57,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12248 conditions, 1855 events. 749/1855 cut-off events. For 9181/10855 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10190 event pairs, 121 based on Foata normal form. 0/1670 useless extension candidates. Maximal degree in co-relation 11239. Up to 1021 conditions per place. [2025-03-15 01:02:57,427 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 64 selfloop transitions, 2 changer transitions 14/325 dead transitions. [2025-03-15 01:02:57,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 325 transitions, 2061 flow [2025-03-15 01:02:57,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:57,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:57,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-03-15 01:02:57,429 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7497812773403325 [2025-03-15 01:02:57,429 INFO L298 CegarLoopForPetriNet]: 381 programPoint places, -71 predicate places. [2025-03-15 01:02:57,429 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 325 transitions, 2061 flow [2025-03-15 01:02:57,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:57,430 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:57,430 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] [2025-03-15 01:02:57,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:02:57,430 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:57,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:57,431 INFO L85 PathProgramCache]: Analyzing trace with hash 621204447, now seen corresponding path program 1 times [2025-03-15 01:02:57,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:57,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196261356] [2025-03-15 01:02:57,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:57,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:57,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:02:57,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:57,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196261356] [2025-03-15 01:02:57,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196261356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:57,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:57,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:57,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774140207] [2025-03-15 01:02:57,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:57,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:57,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:57,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:57,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:57,473 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 381 [2025-03-15 01:02:57,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 325 transitions, 2061 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:57,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:57,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 381 [2025-03-15 01:02:57,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:57,759 INFO L124 PetriNetUnfolderBase]: 749/1854 cut-off events. [2025-03-15 01:02:57,759 INFO L125 PetriNetUnfolderBase]: For 11133/13075 co-relation queries the response was YES. [2025-03-15 01:02:57,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13265 conditions, 1854 events. 749/1854 cut-off events. For 11133/13075 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10200 event pairs, 121 based on Foata normal form. 0/1670 useless extension candidates. Maximal degree in co-relation 12199. Up to 1021 conditions per place. [2025-03-15 01:02:57,783 INFO L140 encePairwiseOnDemand]: 379/381 looper letters, 64 selfloop transitions, 1 changer transitions 14/324 dead transitions. [2025-03-15 01:02:57,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 324 transitions, 2187 flow [2025-03-15 01:02:57,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:57,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2025-03-15 01:02:57,785 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7515310586176728 [2025-03-15 01:02:57,786 INFO L298 CegarLoopForPetriNet]: 381 programPoint places, -70 predicate places. [2025-03-15 01:02:57,786 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 324 transitions, 2187 flow [2025-03-15 01:02:57,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:57,787 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:57,787 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] [2025-03-15 01:02:57,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:02:57,787 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:57,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:57,788 INFO L85 PathProgramCache]: Analyzing trace with hash 744937957, now seen corresponding path program 1 times [2025-03-15 01:02:57,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:57,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949485486] [2025-03-15 01:02:57,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:57,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:57,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:02:57,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:57,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949485486] [2025-03-15 01:02:57,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949485486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:57,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:57,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:57,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503191570] [2025-03-15 01:02:57,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:57,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:57,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:57,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:57,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:57,860 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 381 [2025-03-15 01:02:57,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 324 transitions, 2187 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:57,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:57,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 381 [2025-03-15 01:02:57,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:58,210 INFO L124 PetriNetUnfolderBase]: 749/1853 cut-off events. [2025-03-15 01:02:58,210 INFO L125 PetriNetUnfolderBase]: For 13297/15507 co-relation queries the response was YES. [2025-03-15 01:02:58,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14284 conditions, 1853 events. 749/1853 cut-off events. For 13297/15507 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10197 event pairs, 121 based on Foata normal form. 0/1670 useless extension candidates. Maximal degree in co-relation 13159. Up to 1021 conditions per place. [2025-03-15 01:02:58,229 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 64 selfloop transitions, 2 changer transitions 14/323 dead transitions. [2025-03-15 01:02:58,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 323 transitions, 2317 flow [2025-03-15 01:02:58,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:58,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:58,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-03-15 01:02:58,231 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7497812773403325 [2025-03-15 01:02:58,232 INFO L298 CegarLoopForPetriNet]: 381 programPoint places, -69 predicate places. [2025-03-15 01:02:58,232 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 323 transitions, 2317 flow [2025-03-15 01:02:58,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:58,232 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:58,232 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] [2025-03-15 01:02:58,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:02:58,233 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:58,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:58,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2019802218, now seen corresponding path program 1 times [2025-03-15 01:02:58,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:58,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606126611] [2025-03-15 01:02:58,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:58,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:02:58,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:58,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606126611] [2025-03-15 01:02:58,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606126611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:58,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:58,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:02:58,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941928248] [2025-03-15 01:02:58,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:58,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:02:58,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:58,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:02:58,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:02:58,613 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 381 [2025-03-15 01:02:58,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 323 transitions, 2317 flow. Second operand has 6 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:58,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:58,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 381 [2025-03-15 01:02:58,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:58,966 INFO L124 PetriNetUnfolderBase]: 749/1851 cut-off events. [2025-03-15 01:02:58,966 INFO L125 PetriNetUnfolderBase]: For 15658/18136 co-relation queries the response was YES. [2025-03-15 01:02:58,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15333 conditions, 1851 events. 749/1851 cut-off events. For 15658/18136 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10211 event pairs, 121 based on Foata normal form. 0/1670 useless extension candidates. Maximal degree in co-relation 14119. Up to 1041 conditions per place. [2025-03-15 01:02:58,987 INFO L140 encePairwiseOnDemand]: 369/381 looper letters, 87 selfloop transitions, 10 changer transitions 14/321 dead transitions. [2025-03-15 01:02:58,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 321 transitions, 2507 flow [2025-03-15 01:02:58,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:02:58,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:02:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1534 transitions. [2025-03-15 01:02:58,990 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6710411198600175 [2025-03-15 01:02:58,990 INFO L298 CegarLoopForPetriNet]: 381 programPoint places, -66 predicate places. [2025-03-15 01:02:58,991 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 321 transitions, 2507 flow [2025-03-15 01:02:58,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:58,992 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:58,992 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] [2025-03-15 01:02:58,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:02:58,992 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:58,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:58,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1957141054, now seen corresponding path program 1 times [2025-03-15 01:02:58,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:58,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465855097] [2025-03-15 01:02:58,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:58,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:59,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:02:59,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:59,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465855097] [2025-03-15 01:02:59,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465855097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:59,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:59,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:59,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770509414] [2025-03-15 01:02:59,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:59,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:59,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:59,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:59,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:59,023 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 381 [2025-03-15 01:02:59,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 321 transitions, 2507 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:59,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:59,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 381 [2025-03-15 01:02:59,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:59,300 INFO L124 PetriNetUnfolderBase]: 749/1903 cut-off events. [2025-03-15 01:02:59,300 INFO L125 PetriNetUnfolderBase]: For 20641/23535 co-relation queries the response was YES. [2025-03-15 01:02:59,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16403 conditions, 1903 events. 749/1903 cut-off events. For 20641/23535 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10891 event pairs, 156 based on Foata normal form. 0/1714 useless extension candidates. Maximal degree in co-relation 15132. Up to 1041 conditions per place. [2025-03-15 01:02:59,324 INFO L140 encePairwiseOnDemand]: 379/381 looper letters, 64 selfloop transitions, 1 changer transitions 14/320 dead transitions. [2025-03-15 01:02:59,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 320 transitions, 2633 flow [2025-03-15 01:02:59,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2025-03-15 01:02:59,327 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7515310586176728 [2025-03-15 01:02:59,327 INFO L298 CegarLoopForPetriNet]: 381 programPoint places, -65 predicate places. [2025-03-15 01:02:59,327 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 320 transitions, 2633 flow [2025-03-15 01:02:59,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:59,328 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:59,328 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] [2025-03-15 01:02:59,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:02:59,328 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:59,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:59,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2011799901, now seen corresponding path program 1 times [2025-03-15 01:02:59,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:59,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528831934] [2025-03-15 01:02:59,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:59,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:02:59,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:59,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528831934] [2025-03-15 01:02:59,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528831934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:59,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:59,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:59,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370525133] [2025-03-15 01:02:59,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:59,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:59,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:59,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:59,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:59,370 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 381 [2025-03-15 01:02:59,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 320 transitions, 2633 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:59,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:59,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 381 [2025-03-15 01:02:59,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:59,667 INFO L124 PetriNetUnfolderBase]: 749/1849 cut-off events. [2025-03-15 01:02:59,667 INFO L125 PetriNetUnfolderBase]: For 21005/24019 co-relation queries the response was YES. [2025-03-15 01:02:59,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17369 conditions, 1849 events. 749/1849 cut-off events. For 21005/24019 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10175 event pairs, 121 based on Foata normal form. 0/1670 useless extension candidates. Maximal degree in co-relation 16039. Up to 1041 conditions per place. [2025-03-15 01:02:59,688 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 64 selfloop transitions, 2 changer transitions 14/319 dead transitions. [2025-03-15 01:02:59,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 319 transitions, 2763 flow [2025-03-15 01:02:59,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:59,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-03-15 01:02:59,690 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7497812773403325 [2025-03-15 01:02:59,691 INFO L298 CegarLoopForPetriNet]: 381 programPoint places, -64 predicate places. [2025-03-15 01:02:59,691 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 319 transitions, 2763 flow [2025-03-15 01:02:59,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:59,691 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:59,691 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 01:02:59,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:02:59,691 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:59,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:59,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1080140353, now seen corresponding path program 1 times [2025-03-15 01:02:59,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:59,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149231090] [2025-03-15 01:02:59,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:59,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:02:59,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:59,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149231090] [2025-03-15 01:02:59,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149231090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:59,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:59,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:59,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870389354] [2025-03-15 01:02:59,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:59,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:59,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:59,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:59,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:59,736 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 381 [2025-03-15 01:02:59,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 319 transitions, 2763 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:59,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:59,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 381 [2025-03-15 01:02:59,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:59,991 INFO L124 PetriNetUnfolderBase]: 749/1848 cut-off events. [2025-03-15 01:02:59,991 INFO L125 PetriNetUnfolderBase]: For 23982/27264 co-relation queries the response was YES. [2025-03-15 01:02:59,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18386 conditions, 1848 events. 749/1848 cut-off events. For 23982/27264 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10155 event pairs, 121 based on Foata normal form. 0/1670 useless extension candidates. Maximal degree in co-relation 16999. Up to 1041 conditions per place. [2025-03-15 01:03:00,015 INFO L140 encePairwiseOnDemand]: 379/381 looper letters, 64 selfloop transitions, 1 changer transitions 14/318 dead transitions. [2025-03-15 01:03:00,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 318 transitions, 2889 flow [2025-03-15 01:03:00,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:00,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2025-03-15 01:03:00,017 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7515310586176728 [2025-03-15 01:03:00,017 INFO L298 CegarLoopForPetriNet]: 381 programPoint places, -63 predicate places. [2025-03-15 01:03:00,017 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 318 transitions, 2889 flow [2025-03-15 01:03:00,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:00,018 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:00,018 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] [2025-03-15 01:03:00,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:03:00,018 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:03:00,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:00,019 INFO L85 PathProgramCache]: Analyzing trace with hash 423495662, now seen corresponding path program 1 times [2025-03-15 01:03:00,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:00,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819254924] [2025-03-15 01:03:00,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:00,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:03:00,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:00,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819254924] [2025-03-15 01:03:00,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819254924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:00,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:00,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:00,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880686265] [2025-03-15 01:03:00,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:00,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:00,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:00,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:00,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:00,073 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 381 [2025-03-15 01:03:00,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 318 transitions, 2889 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:00,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:00,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 381 [2025-03-15 01:03:00,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:00,378 INFO L124 PetriNetUnfolderBase]: 758/1968 cut-off events. [2025-03-15 01:03:00,378 INFO L125 PetriNetUnfolderBase]: For 33898/37727 co-relation queries the response was YES. [2025-03-15 01:03:00,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19770 conditions, 1968 events. 758/1968 cut-off events. For 33898/37727 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11379 event pairs, 127 based on Foata normal form. 1/1774 useless extension candidates. Maximal degree in co-relation 14146. Up to 1055 conditions per place. [2025-03-15 01:03:00,403 INFO L140 encePairwiseOnDemand]: 375/381 looper letters, 68 selfloop transitions, 5 changer transitions 14/325 dead transitions. [2025-03-15 01:03:00,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 325 transitions, 3315 flow [2025-03-15 01:03:00,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:00,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 867 transitions. [2025-03-15 01:03:00,405 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7585301837270341 [2025-03-15 01:03:00,406 INFO L298 CegarLoopForPetriNet]: 381 programPoint places, -62 predicate places. [2025-03-15 01:03:00,406 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 325 transitions, 3315 flow [2025-03-15 01:03:00,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:00,407 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:00,407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:03:00,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 01:03:00,407 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:03:00,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:00,408 INFO L85 PathProgramCache]: Analyzing trace with hash -842196123, now seen corresponding path program 1 times [2025-03-15 01:03:00,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:00,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473647605] [2025-03-15 01:03:00,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:00,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:00,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:03:00,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:00,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473647605] [2025-03-15 01:03:00,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473647605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:00,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:00,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:00,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945120387] [2025-03-15 01:03:00,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:00,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:00,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:00,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:00,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:00,469 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 381 [2025-03-15 01:03:00,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 325 transitions, 3315 flow. Second operand has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:00,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:00,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 381 [2025-03-15 01:03:00,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:00,858 INFO L124 PetriNetUnfolderBase]: 758/1965 cut-off events. [2025-03-15 01:03:00,858 INFO L125 PetriNetUnfolderBase]: For 38031/42113 co-relation queries the response was YES. [2025-03-15 01:03:00,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20804 conditions, 1965 events. 758/1965 cut-off events. For 38031/42113 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11327 event pairs, 127 based on Foata normal form. 0/1773 useless extension candidates. Maximal degree in co-relation 14900. Up to 1055 conditions per place. [2025-03-15 01:03:00,870 INFO L140 encePairwiseOnDemand]: 379/381 looper letters, 0 selfloop transitions, 0 changer transitions 324/324 dead transitions. [2025-03-15 01:03:00,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 324 transitions, 3455 flow [2025-03-15 01:03:00,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:00,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2025-03-15 01:03:00,872 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.757655293088364 [2025-03-15 01:03:00,872 INFO L298 CegarLoopForPetriNet]: 381 programPoint places, -61 predicate places. [2025-03-15 01:03:00,872 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 324 transitions, 3455 flow [2025-03-15 01:03:00,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:00,884 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/popl20-more-buffer-mult2.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 01:03:00,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (162 of 163 remaining) [2025-03-15 01:03:00,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (161 of 163 remaining) [2025-03-15 01:03:00,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (160 of 163 remaining) [2025-03-15 01:03:00,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (159 of 163 remaining) [2025-03-15 01:03:00,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (158 of 163 remaining) [2025-03-15 01:03:00,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (157 of 163 remaining) [2025-03-15 01:03:00,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (156 of 163 remaining) [2025-03-15 01:03:00,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (155 of 163 remaining) [2025-03-15 01:03:00,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (154 of 163 remaining) [2025-03-15 01:03:00,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (153 of 163 remaining) [2025-03-15 01:03:00,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (152 of 163 remaining) [2025-03-15 01:03:00,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (151 of 163 remaining) [2025-03-15 01:03:00,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (150 of 163 remaining) [2025-03-15 01:03:00,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (149 of 163 remaining) [2025-03-15 01:03:00,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (148 of 163 remaining) [2025-03-15 01:03:00,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (147 of 163 remaining) [2025-03-15 01:03:00,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (146 of 163 remaining) [2025-03-15 01:03:00,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (145 of 163 remaining) [2025-03-15 01:03:00,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (144 of 163 remaining) [2025-03-15 01:03:00,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (143 of 163 remaining) [2025-03-15 01:03:00,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (142 of 163 remaining) [2025-03-15 01:03:00,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (141 of 163 remaining) [2025-03-15 01:03:00,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (140 of 163 remaining) [2025-03-15 01:03:00,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (139 of 163 remaining) [2025-03-15 01:03:00,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (138 of 163 remaining) [2025-03-15 01:03:00,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (137 of 163 remaining) [2025-03-15 01:03:00,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (136 of 163 remaining) [2025-03-15 01:03:00,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (135 of 163 remaining) [2025-03-15 01:03:00,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (134 of 163 remaining) [2025-03-15 01:03:00,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (133 of 163 remaining) [2025-03-15 01:03:00,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (132 of 163 remaining) [2025-03-15 01:03:00,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (131 of 163 remaining) [2025-03-15 01:03:00,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (130 of 163 remaining) [2025-03-15 01:03:00,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (129 of 163 remaining) [2025-03-15 01:03:00,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (128 of 163 remaining) [2025-03-15 01:03:00,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (127 of 163 remaining) [2025-03-15 01:03:00,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (126 of 163 remaining) [2025-03-15 01:03:00,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (125 of 163 remaining) [2025-03-15 01:03:00,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (124 of 163 remaining) [2025-03-15 01:03:00,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (123 of 163 remaining) [2025-03-15 01:03:00,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (122 of 163 remaining) [2025-03-15 01:03:00,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (121 of 163 remaining) [2025-03-15 01:03:00,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (120 of 163 remaining) [2025-03-15 01:03:00,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (119 of 163 remaining) [2025-03-15 01:03:00,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (118 of 163 remaining) [2025-03-15 01:03:00,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (117 of 163 remaining) [2025-03-15 01:03:00,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (116 of 163 remaining) [2025-03-15 01:03:00,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (115 of 163 remaining) [2025-03-15 01:03:00,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (114 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (113 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (112 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (111 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (110 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (109 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (108 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (107 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (106 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (105 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (104 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (103 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (102 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (101 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (100 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (99 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (98 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (97 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (96 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (95 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (94 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (93 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (92 of 163 remaining) [2025-03-15 01:03:00,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (91 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (89 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (88 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (87 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (86 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (85 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (84 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (83 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (82 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (81 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (80 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (79 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (78 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (77 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (76 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (75 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (74 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (73 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (72 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (71 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (70 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (69 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (68 of 163 remaining) [2025-03-15 01:03:00,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (67 of 163 remaining) [2025-03-15 01:03:00,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (66 of 163 remaining) [2025-03-15 01:03:00,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (65 of 163 remaining) [2025-03-15 01:03:00,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (64 of 163 remaining) [2025-03-15 01:03:00,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (63 of 163 remaining) [2025-03-15 01:03:00,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (62 of 163 remaining) [2025-03-15 01:03:00,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (61 of 163 remaining) [2025-03-15 01:03:00,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (60 of 163 remaining) [2025-03-15 01:03:00,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (59 of 163 remaining) [2025-03-15 01:03:00,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (58 of 163 remaining) [2025-03-15 01:03:00,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (57 of 163 remaining) [2025-03-15 01:03:00,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (56 of 163 remaining) [2025-03-15 01:03:00,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (55 of 163 remaining) [2025-03-15 01:03:00,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (54 of 163 remaining) [2025-03-15 01:03:00,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (53 of 163 remaining) [2025-03-15 01:03:00,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (52 of 163 remaining) [2025-03-15 01:03:00,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (51 of 163 remaining) [2025-03-15 01:03:00,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (50 of 163 remaining) [2025-03-15 01:03:00,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (49 of 163 remaining) [2025-03-15 01:03:00,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (48 of 163 remaining) [2025-03-15 01:03:00,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (47 of 163 remaining) [2025-03-15 01:03:00,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (46 of 163 remaining) [2025-03-15 01:03:00,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (45 of 163 remaining) [2025-03-15 01:03:00,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (44 of 163 remaining) [2025-03-15 01:03:00,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (43 of 163 remaining) [2025-03-15 01:03:00,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (42 of 163 remaining) [2025-03-15 01:03:00,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (41 of 163 remaining) [2025-03-15 01:03:00,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (40 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (33 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (30 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (29 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (28 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (27 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (26 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (25 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (24 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (23 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (22 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (21 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (20 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (19 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (18 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (17 of 163 remaining) [2025-03-15 01:03:00,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (16 of 163 remaining) [2025-03-15 01:03:00,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (15 of 163 remaining) [2025-03-15 01:03:00,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (14 of 163 remaining) [2025-03-15 01:03:00,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (13 of 163 remaining) [2025-03-15 01:03:00,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (12 of 163 remaining) [2025-03-15 01:03:00,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (11 of 163 remaining) [2025-03-15 01:03:00,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (10 of 163 remaining) [2025-03-15 01:03:00,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (9 of 163 remaining) [2025-03-15 01:03:00,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (8 of 163 remaining) [2025-03-15 01:03:00,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (7 of 163 remaining) [2025-03-15 01:03:00,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 163 remaining) [2025-03-15 01:03:00,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (5 of 163 remaining) [2025-03-15 01:03:00,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (4 of 163 remaining) [2025-03-15 01:03:00,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (3 of 163 remaining) [2025-03-15 01:03:00,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (2 of 163 remaining) [2025-03-15 01:03:00,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (1 of 163 remaining) [2025-03-15 01:03:00,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (0 of 163 remaining) [2025-03-15 01:03:00,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 01:03:00,939 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:03:00,945 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:03:00,945 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:03:00,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:03:00 BasicIcfg [2025-03-15 01:03:00,951 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:03:00,951 INFO L158 Benchmark]: Toolchain (without parser) took 8762.70ms. Allocated memory was 71.3MB in the beginning and 784.3MB in the end (delta: 713.0MB). Free memory was 44.9MB in the beginning and 531.6MB in the end (delta: -486.7MB). Peak memory consumption was 422.9MB. Max. memory is 8.0GB. [2025-03-15 01:03:00,951 INFO L158 Benchmark]: CDTParser took 1.26ms. Allocated memory is still 71.3MB. Free memory is still 33.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:03:00,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.78ms. Allocated memory is still 71.3MB. Free memory was 44.8MB in the beginning and 30.7MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 01:03:00,952 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.80ms. Allocated memory is still 71.3MB. Free memory was 30.7MB in the beginning and 27.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:03:00,952 INFO L158 Benchmark]: Boogie Preprocessor took 44.38ms. Allocated memory is still 71.3MB. Free memory was 27.2MB in the beginning and 24.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:03:00,952 INFO L158 Benchmark]: RCFGBuilder took 1157.79ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 24.3MB in the beginning and 28.2MB in the end (delta: -3.9MB). Peak memory consumption was 26.8MB. Max. memory is 8.0GB. [2025-03-15 01:03:00,952 INFO L158 Benchmark]: TraceAbstraction took 7246.98ms. Allocated memory was 88.1MB in the beginning and 784.3MB in the end (delta: 696.3MB). Free memory was 27.6MB in the beginning and 531.6MB in the end (delta: -504.0MB). Peak memory consumption was 387.7MB. Max. memory is 8.0GB. [2025-03-15 01:03:00,953 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.26ms. Allocated memory is still 71.3MB. Free memory is still 33.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.78ms. Allocated memory is still 71.3MB. Free memory was 44.8MB in the beginning and 30.7MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.80ms. Allocated memory is still 71.3MB. Free memory was 30.7MB in the beginning and 27.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.38ms. Allocated memory is still 71.3MB. Free memory was 27.2MB in the beginning and 24.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 1157.79ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 24.3MB in the beginning and 28.2MB in the end (delta: -3.9MB). Peak memory consumption was 26.8MB. Max. memory is 8.0GB. * TraceAbstraction took 7246.98ms. Allocated memory was 88.1MB in the beginning and 784.3MB in the end (delta: 696.3MB). Free memory was 27.6MB in the beginning and 531.6MB in the end (delta: -504.0MB). Peak memory consumption was 387.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: 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: 68]: 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: 72]: 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: 73]: 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: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: 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 9 procedures, 475 locations, 163 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: 7.1s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 105 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 853 IncrementalHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 105 mSDtfsCounter, 853 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3455occurred in iteration=18, InterpolantAutomatonStates: 57, 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, 1.0s InterpolantComputationTime, 1756 NumberOfCodeBlocks, 1756 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1738 ConstructedInterpolants, 0 QuantifiedInterpolants, 1887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 89 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:03:00,972 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...