/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/goblint-regression/09-regions_19-nested_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:37:29,731 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:37:29,777 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 00:37:29,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:37:29,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:37:29,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:37:29,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:37:29,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:37:29,822 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:37:29,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:37:29,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:37:29,823 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:37:29,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:37:29,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:37:29,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:37:29,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:37:29,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:37:29,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:37:29,823 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:37:29,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:37:29,823 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:37:29,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:37:29,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:37:29,823 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:37:29,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:37:29,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:37:29,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:37:29,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:37:29,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:37:29,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:37:29,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:37:29,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:37:29,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2025-03-15 00:37:30,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:37:30,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:37:30,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:37:30,073 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:37:30,073 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:37:30,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_19-nested_nr.i [2025-03-15 00:37:31,276 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d61a68bc/efb68b2a863448ec8f408117d2bd2888/FLAGd0a633e1b [2025-03-15 00:37:31,539 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:37:31,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_19-nested_nr.i [2025-03-15 00:37:31,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d61a68bc/efb68b2a863448ec8f408117d2bd2888/FLAGd0a633e1b [2025-03-15 00:37:31,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d61a68bc/efb68b2a863448ec8f408117d2bd2888 [2025-03-15 00:37:31,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:37:31,838 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:37:31,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:37:31,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:37:31,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:37:31,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:37:31" (1/1) ... [2025-03-15 00:37:31,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@784fe7ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:31, skipping insertion in model container [2025-03-15 00:37:31,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:37:31" (1/1) ... [2025-03-15 00:37:31,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:37:32,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:37:32,239 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:37:32,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:37:32,347 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:37:32,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:32 WrapperNode [2025-03-15 00:37:32,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:37:32,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:37:32,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:37:32,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:37:32,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:32" (1/1) ... [2025-03-15 00:37:32,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:32" (1/1) ... [2025-03-15 00:37:32,408 INFO L138 Inliner]: procedures = 372, calls = 87, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 292 [2025-03-15 00:37:32,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:37:32,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:37:32,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:37:32,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:37:32,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:32" (1/1) ... [2025-03-15 00:37:32,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:32" (1/1) ... [2025-03-15 00:37:32,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:32" (1/1) ... [2025-03-15 00:37:32,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:32" (1/1) ... [2025-03-15 00:37:32,435 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:32" (1/1) ... [2025-03-15 00:37:32,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:32" (1/1) ... [2025-03-15 00:37:32,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:32" (1/1) ... [2025-03-15 00:37:32,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:32" (1/1) ... [2025-03-15 00:37:32,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:32" (1/1) ... [2025-03-15 00:37:32,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:37:32,455 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:37:32,455 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:37:32,455 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:37:32,456 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:32" (1/1) ... [2025-03-15 00:37:32,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:37:32,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:37:32,480 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 00:37:32,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 00:37:32,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-15 00:37:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-15 00:37:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:37:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:37:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:37:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:37:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 00:37:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:37:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-15 00:37:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 00:37:32,499 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 00:37:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:37:32,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:37:32,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:37:32,500 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 00:37:32,604 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:37:32,606 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:37:33,051 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:37:33,051 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:37:33,077 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:37:33,077 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:37:33,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:37:33 BoogieIcfgContainer [2025-03-15 00:37:33,079 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:37:33,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:37:33,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:37:33,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:37:33,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:37:31" (1/3) ... [2025-03-15 00:37:33,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b83024d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:37:33, skipping insertion in model container [2025-03-15 00:37:33,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:37:32" (2/3) ... [2025-03-15 00:37:33,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b83024d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:37:33, skipping insertion in model container [2025-03-15 00:37:33,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:37:33" (3/3) ... [2025-03-15 00:37:33,087 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_19-nested_nr.i [2025-03-15 00:37:33,099 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:37:33,101 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_19-nested_nr.i that has 2 procedures, 334 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-03-15 00:37:33,101 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:37:33,166 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 00:37:33,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:37:33,208 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;@258f76fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:37:33,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-15 00:37:33,257 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:37:33,257 INFO L124 PetriNetUnfolderBase]: 2/125 cut-off events. [2025-03-15 00:37:33,259 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:37:33,259 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:33,260 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] [2025-03-15 00:37:33,261 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:33,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:33,265 INFO L85 PathProgramCache]: Analyzing trace with hash 106993482, now seen corresponding path program 1 times [2025-03-15 00:37:33,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:33,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254519759] [2025-03-15 00:37:33,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:33,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:37:33,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:33,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254519759] [2025-03-15 00:37:33,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254519759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:33,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:33,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:37:33,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723444997] [2025-03-15 00:37:33,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:33,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:37:33,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:33,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:37:33,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:37:33,598 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-15 00:37:33,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 337 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:33,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:33,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-15 00:37:33,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:33,744 INFO L124 PetriNetUnfolderBase]: 8/414 cut-off events. [2025-03-15 00:37:33,744 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 00:37:33,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 414 events. 8/414 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 870 event pairs, 6 based on Foata normal form. 4/386 useless extension candidates. Maximal degree in co-relation 223. Up to 27 conditions per place. [2025-03-15 00:37:33,757 INFO L140 encePairwiseOnDemand]: 332/337 looper letters, 16 selfloop transitions, 2 changer transitions 1/338 dead transitions. [2025-03-15 00:37:33,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 338 transitions, 715 flow [2025-03-15 00:37:33,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:37:33,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:37:33,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 984 transitions. [2025-03-15 00:37:33,770 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.973293768545994 [2025-03-15 00:37:33,773 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, 1 predicate places. [2025-03-15 00:37:33,773 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 338 transitions, 715 flow [2025-03-15 00:37:33,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:33,774 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:33,774 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:33,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:37:33,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:33,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:33,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1141151438, now seen corresponding path program 1 times [2025-03-15 00:37:33,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:33,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981168485] [2025-03-15 00:37:33,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:33,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:37:34,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:34,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981168485] [2025-03-15 00:37:34,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981168485] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:37:34,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030031130] [2025-03-15 00:37:34,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:34,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:37:34,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:37:34,011 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:37:34,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-15 00:37:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:34,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 00:37:34,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:37:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:37:34,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:37:34,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:37:34,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030031130] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:37:34,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:37:34,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-15 00:37:34,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31196342] [2025-03-15 00:37:34,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:37:34,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:37:34,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:34,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:37:34,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-15 00:37:34,239 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 337 [2025-03-15 00:37:34,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 338 transitions, 715 flow. Second operand has 10 states, 10 states have (on average 322.1) internal successors, (3221), 10 states have internal predecessors, (3221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:34,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:34,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 337 [2025-03-15 00:37:34,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:34,383 INFO L124 PetriNetUnfolderBase]: 8/421 cut-off events. [2025-03-15 00:37:34,383 INFO L125 PetriNetUnfolderBase]: For 17/31 co-relation queries the response was YES. [2025-03-15 00:37:34,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 421 events. 8/421 cut-off events. For 17/31 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 877 event pairs, 6 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 255. Up to 32 conditions per place. [2025-03-15 00:37:34,386 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 17 selfloop transitions, 9 changer transitions 1/345 dead transitions. [2025-03-15 00:37:34,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 345 transitions, 791 flow [2025-03-15 00:37:34,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:37:34,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:37:34,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2908 transitions. [2025-03-15 00:37:34,393 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9587866798549292 [2025-03-15 00:37:34,394 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, 9 predicate places. [2025-03-15 00:37:34,394 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 345 transitions, 791 flow [2025-03-15 00:37:34,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 322.1) internal successors, (3221), 10 states have internal predecessors, (3221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:34,396 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:34,396 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:34,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-15 00:37:34,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:37:34,597 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:34,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:34,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2066027598, now seen corresponding path program 2 times [2025-03-15 00:37:34,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:34,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529573854] [2025-03-15 00:37:34,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:37:34,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:34,627 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:37:34,627 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:37:35,083 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-15 00:37:35,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:35,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529573854] [2025-03-15 00:37:35,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529573854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:35,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:35,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:37:35,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515389338] [2025-03-15 00:37:35,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:35,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:37:35,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:35,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:37:35,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:37:35,086 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 337 [2025-03-15 00:37:35,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 345 transitions, 791 flow. Second operand has 6 states, 6 states have (on average 207.5) internal successors, (1245), 6 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:35,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:35,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 337 [2025-03-15 00:37:35,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:35,798 INFO L124 PetriNetUnfolderBase]: 764/2498 cut-off events. [2025-03-15 00:37:35,798 INFO L125 PetriNetUnfolderBase]: For 367/385 co-relation queries the response was YES. [2025-03-15 00:37:35,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4451 conditions, 2498 events. 764/2498 cut-off events. For 367/385 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 14994 event pairs, 762 based on Foata normal form. 0/2221 useless extension candidates. Maximal degree in co-relation 4119. Up to 1640 conditions per place. [2025-03-15 00:37:35,811 INFO L140 encePairwiseOnDemand]: 325/337 looper letters, 117 selfloop transitions, 10 changer transitions 1/343 dead transitions. [2025-03-15 00:37:35,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 343 transitions, 1041 flow [2025-03-15 00:37:35,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:37:35,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:37:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1365 transitions. [2025-03-15 00:37:35,815 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6750741839762612 [2025-03-15 00:37:35,816 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, 12 predicate places. [2025-03-15 00:37:35,816 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 343 transitions, 1041 flow [2025-03-15 00:37:35,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 207.5) internal successors, (1245), 6 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:35,817 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:35,817 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:35,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:37:35,818 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:35,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:35,818 INFO L85 PathProgramCache]: Analyzing trace with hash 291569409, now seen corresponding path program 1 times [2025-03-15 00:37:35,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:35,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422552946] [2025-03-15 00:37:35,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:35,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-15 00:37:35,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:35,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422552946] [2025-03-15 00:37:35,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422552946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:35,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:35,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:37:35,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551631765] [2025-03-15 00:37:35,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:35,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:37:35,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:35,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:37:35,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:37:35,916 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 337 [2025-03-15 00:37:35,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 343 transitions, 1041 flow. Second operand has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:35,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:35,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 337 [2025-03-15 00:37:35,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:36,449 INFO L124 PetriNetUnfolderBase]: 764/2609 cut-off events. [2025-03-15 00:37:36,450 INFO L125 PetriNetUnfolderBase]: For 736/764 co-relation queries the response was YES. [2025-03-15 00:37:36,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4799 conditions, 2609 events. 764/2609 cut-off events. For 736/764 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 15003 event pairs, 762 based on Foata normal form. 0/2325 useless extension candidates. Maximal degree in co-relation 4248. Up to 1698 conditions per place. [2025-03-15 00:37:36,461 INFO L140 encePairwiseOnDemand]: 334/337 looper letters, 42 selfloop transitions, 2 changer transitions 1/360 dead transitions. [2025-03-15 00:37:36,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 360 transitions, 1187 flow [2025-03-15 00:37:36,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:37:36,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:37:36,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 969 transitions. [2025-03-15 00:37:36,464 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9584569732937686 [2025-03-15 00:37:36,464 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, 14 predicate places. [2025-03-15 00:37:36,465 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 360 transitions, 1187 flow [2025-03-15 00:37:36,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:36,465 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:36,465 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:36,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:37:36,466 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:36,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:36,466 INFO L85 PathProgramCache]: Analyzing trace with hash 681722666, now seen corresponding path program 1 times [2025-03-15 00:37:36,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:36,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859810746] [2025-03-15 00:37:36,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:36,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:37:36,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:36,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859810746] [2025-03-15 00:37:36,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859810746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:37:36,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848787166] [2025-03-15 00:37:36,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:36,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:37:36,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:37:36,649 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:37:36,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-15 00:37:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:36,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-15 00:37:36,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:37:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:37:36,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:37:36,848 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:37:36,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848787166] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:37:36,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:37:36,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-15 00:37:36,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344919956] [2025-03-15 00:37:36,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:37:36,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-15 00:37:36,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:36,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-15 00:37:36,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-15 00:37:36,855 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 337 [2025-03-15 00:37:36,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 360 transitions, 1187 flow. Second operand has 18 states, 18 states have (on average 322.27777777777777) internal successors, (5801), 18 states have internal predecessors, (5801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:36,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:36,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 337 [2025-03-15 00:37:36,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:37,318 INFO L124 PetriNetUnfolderBase]: 764/2629 cut-off events. [2025-03-15 00:37:37,318 INFO L125 PetriNetUnfolderBase]: For 1222/1254 co-relation queries the response was YES. [2025-03-15 00:37:37,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5026 conditions, 2629 events. 764/2629 cut-off events. For 1222/1254 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 15004 event pairs, 762 based on Foata normal form. 0/2345 useless extension candidates. Maximal degree in co-relation 4377. Up to 1698 conditions per place. [2025-03-15 00:37:37,327 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 25 selfloop transitions, 21 changer transitions 1/380 dead transitions. [2025-03-15 00:37:37,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 380 transitions, 1391 flow [2025-03-15 00:37:37,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-15 00:37:37,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-15 00:37:37,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6770 transitions. [2025-03-15 00:37:37,336 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9566200367387311 [2025-03-15 00:37:37,337 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, 34 predicate places. [2025-03-15 00:37:37,337 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 380 transitions, 1391 flow [2025-03-15 00:37:37,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 322.27777777777777) internal successors, (5801), 18 states have internal predecessors, (5801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:37,339 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:37,340 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:37,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-15 00:37:37,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:37:37,540 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:37,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:37,541 INFO L85 PathProgramCache]: Analyzing trace with hash -799826390, now seen corresponding path program 2 times [2025-03-15 00:37:37,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:37,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620482005] [2025-03-15 00:37:37,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:37:37,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:37,600 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:37:37,600 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:37:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-15 00:37:37,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:37,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620482005] [2025-03-15 00:37:37,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620482005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:37,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:37,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:37:37,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847948638] [2025-03-15 00:37:37,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:37,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:37:37,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:37,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:37:37,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:37:37,980 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 337 [2025-03-15 00:37:37,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 380 transitions, 1391 flow. Second operand has 6 states, 6 states have (on average 208.5) internal successors, (1251), 6 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:37,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:37,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 337 [2025-03-15 00:37:37,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:38,630 INFO L124 PetriNetUnfolderBase]: 764/2625 cut-off events. [2025-03-15 00:37:38,631 INFO L125 PetriNetUnfolderBase]: For 1595/1783 co-relation queries the response was YES. [2025-03-15 00:37:38,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6732 conditions, 2625 events. 764/2625 cut-off events. For 1595/1783 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 14996 event pairs, 762 based on Foata normal form. 0/2345 useless extension candidates. Maximal degree in co-relation 5957. Up to 1694 conditions per place. [2025-03-15 00:37:38,644 INFO L140 encePairwiseOnDemand]: 325/337 looper letters, 127 selfloop transitions, 10 changer transitions 1/378 dead transitions. [2025-03-15 00:37:38,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 378 transitions, 1657 flow [2025-03-15 00:37:38,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:37:38,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:37:38,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1363 transitions. [2025-03-15 00:37:38,648 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6740850642927795 [2025-03-15 00:37:38,648 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, 37 predicate places. [2025-03-15 00:37:38,648 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 378 transitions, 1657 flow [2025-03-15 00:37:38,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 208.5) internal successors, (1251), 6 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:38,649 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:38,649 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:38,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:37:38,649 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:38,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:38,650 INFO L85 PathProgramCache]: Analyzing trace with hash -183571133, now seen corresponding path program 1 times [2025-03-15 00:37:38,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:38,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321723602] [2025-03-15 00:37:38,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:38,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:37:39,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:39,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321723602] [2025-03-15 00:37:39,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321723602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:37:39,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525119873] [2025-03-15 00:37:39,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:39,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:37:39,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:37:39,007 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:37:39,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-15 00:37:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:39,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-15 00:37:39,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:37:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:37:39,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:37:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:37:39,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525119873] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:37:39,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:37:39,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-15 00:37:39,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707478843] [2025-03-15 00:37:39,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:37:39,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-15 00:37:39,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:39,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-15 00:37:39,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-15 00:37:39,374 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 337 [2025-03-15 00:37:39,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 378 transitions, 1657 flow. Second operand has 23 states, 23 states have (on average 322.4347826086956) internal successors, (7416), 23 states have internal predecessors, (7416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:39,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:39,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 337 [2025-03-15 00:37:39,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:39,902 INFO L124 PetriNetUnfolderBase]: 764/2640 cut-off events. [2025-03-15 00:37:39,902 INFO L125 PetriNetUnfolderBase]: For 2296/2494 co-relation queries the response was YES. [2025-03-15 00:37:39,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6975 conditions, 2640 events. 764/2640 cut-off events. For 2296/2494 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 14997 event pairs, 762 based on Foata normal form. 0/2360 useless extension candidates. Maximal degree in co-relation 6086. Up to 1694 conditions per place. [2025-03-15 00:37:39,914 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 31 selfloop transitions, 30 changer transitions 1/393 dead transitions. [2025-03-15 00:37:39,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 393 transitions, 1893 flow [2025-03-15 00:37:39,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-15 00:37:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-15 00:37:39,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9664 transitions. [2025-03-15 00:37:39,926 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9558852621167161 [2025-03-15 00:37:39,926 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, 66 predicate places. [2025-03-15 00:37:39,926 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 393 transitions, 1893 flow [2025-03-15 00:37:39,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 322.4347826086956) internal successors, (7416), 23 states have internal predecessors, (7416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:39,928 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:39,928 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:39,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-15 00:37:40,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:37:40,133 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:40,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:40,134 INFO L85 PathProgramCache]: Analyzing trace with hash -15000641, now seen corresponding path program 2 times [2025-03-15 00:37:40,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:40,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117382557] [2025-03-15 00:37:40,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:37:40,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:40,152 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:37:40,152 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:37:40,423 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:37:40,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:40,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117382557] [2025-03-15 00:37:40,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117382557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:40,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:40,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:37:40,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137137474] [2025-03-15 00:37:40,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:40,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:37:40,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:40,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:37:40,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:37:40,425 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 337 [2025-03-15 00:37:40,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 393 transitions, 1893 flow. Second operand has 6 states, 6 states have (on average 159.66666666666666) internal successors, (958), 6 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:40,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:40,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 337 [2025-03-15 00:37:40,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:40,945 INFO L124 PetriNetUnfolderBase]: 860/2859 cut-off events. [2025-03-15 00:37:40,945 INFO L125 PetriNetUnfolderBase]: For 3496/3865 co-relation queries the response was YES. [2025-03-15 00:37:40,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9527 conditions, 2859 events. 860/2859 cut-off events. For 3496/3865 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 16707 event pairs, 858 based on Foata normal form. 0/2564 useless extension candidates. Maximal degree in co-relation 8457. Up to 1956 conditions per place. [2025-03-15 00:37:40,964 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 200 selfloop transitions, 9 changer transitions 1/391 dead transitions. [2025-03-15 00:37:40,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 391 transitions, 2295 flow [2025-03-15 00:37:40,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:37:40,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:37:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1061 transitions. [2025-03-15 00:37:40,967 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5247279920870426 [2025-03-15 00:37:40,968 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, 70 predicate places. [2025-03-15 00:37:40,968 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 391 transitions, 2295 flow [2025-03-15 00:37:40,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 159.66666666666666) internal successors, (958), 6 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:40,968 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:40,968 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:40,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:37:40,968 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:40,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:40,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1003869220, now seen corresponding path program 1 times [2025-03-15 00:37:40,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:40,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637941118] [2025-03-15 00:37:40,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:40,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:37:41,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:41,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637941118] [2025-03-15 00:37:41,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637941118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:41,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:41,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:37:41,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345778916] [2025-03-15 00:37:41,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:41,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:37:41,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:41,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:37:41,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:37:41,405 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 337 [2025-03-15 00:37:41,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 391 transitions, 2295 flow. Second operand has 6 states, 6 states have (on average 164.16666666666666) internal successors, (985), 6 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:41,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:41,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 337 [2025-03-15 00:37:41,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:42,099 INFO L124 PetriNetUnfolderBase]: 860/2857 cut-off events. [2025-03-15 00:37:42,100 INFO L125 PetriNetUnfolderBase]: For 4316/4871 co-relation queries the response was YES. [2025-03-15 00:37:42,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11477 conditions, 2857 events. 860/2857 cut-off events. For 4316/4871 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 16674 event pairs, 858 based on Foata normal form. 0/2564 useless extension candidates. Maximal degree in co-relation 10234. Up to 1954 conditions per place. [2025-03-15 00:37:42,112 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 196 selfloop transitions, 9 changer transitions 1/389 dead transitions. [2025-03-15 00:37:42,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 389 transitions, 2685 flow [2025-03-15 00:37:42,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:37:42,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:37:42,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1070 transitions. [2025-03-15 00:37:42,115 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5291790306627102 [2025-03-15 00:37:42,115 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, 74 predicate places. [2025-03-15 00:37:42,115 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 389 transitions, 2685 flow [2025-03-15 00:37:42,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 164.16666666666666) internal successors, (985), 6 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:42,116 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:42,116 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:42,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:37:42,116 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:42,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:42,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1238634258, now seen corresponding path program 1 times [2025-03-15 00:37:42,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:42,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382835117] [2025-03-15 00:37:42,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:42,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:42,506 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:37:42,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:42,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382835117] [2025-03-15 00:37:42,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382835117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:42,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:42,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:37:42,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170635503] [2025-03-15 00:37:42,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:42,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:37:42,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:42,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:37:42,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:37:42,508 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 337 [2025-03-15 00:37:42,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 389 transitions, 2685 flow. Second operand has 6 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:42,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:42,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 337 [2025-03-15 00:37:42,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:43,096 INFO L124 PetriNetUnfolderBase]: 860/2855 cut-off events. [2025-03-15 00:37:43,096 INFO L125 PetriNetUnfolderBase]: For 5333/6050 co-relation queries the response was YES. [2025-03-15 00:37:43,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13247 conditions, 2855 events. 860/2855 cut-off events. For 5333/6050 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 16677 event pairs, 858 based on Foata normal form. 0/2564 useless extension candidates. Maximal degree in co-relation 11908. Up to 1952 conditions per place. [2025-03-15 00:37:43,107 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 116 selfloop transitions, 5 changer transitions 1/388 dead transitions. [2025-03-15 00:37:43,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 388 transitions, 2917 flow [2025-03-15 00:37:43,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:37:43,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:37:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1414 transitions. [2025-03-15 00:37:43,109 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6993076162215628 [2025-03-15 00:37:43,110 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, 78 predicate places. [2025-03-15 00:37:43,110 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 388 transitions, 2917 flow [2025-03-15 00:37:43,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:43,110 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:43,111 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:43,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:37:43,111 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:43,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:43,111 INFO L85 PathProgramCache]: Analyzing trace with hash -142078714, now seen corresponding path program 1 times [2025-03-15 00:37:43,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:43,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554054691] [2025-03-15 00:37:43,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:43,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:37:43,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:43,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554054691] [2025-03-15 00:37:43,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554054691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:43,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:43,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:37:43,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799338621] [2025-03-15 00:37:43,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:43,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:37:43,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:43,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:37:43,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:37:43,551 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 337 [2025-03-15 00:37:43,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 388 transitions, 2917 flow. Second operand has 6 states, 6 states have (on average 222.5) internal successors, (1335), 6 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:43,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:43,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 337 [2025-03-15 00:37:43,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:44,160 INFO L124 PetriNetUnfolderBase]: 860/2853 cut-off events. [2025-03-15 00:37:44,160 INFO L125 PetriNetUnfolderBase]: For 6566/7431 co-relation queries the response was YES. [2025-03-15 00:37:44,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15017 conditions, 2853 events. 860/2853 cut-off events. For 6566/7431 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 16672 event pairs, 858 based on Foata normal form. 0/2564 useless extension candidates. Maximal degree in co-relation 13582. Up to 1950 conditions per place. [2025-03-15 00:37:44,175 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 117 selfloop transitions, 5 changer transitions 1/387 dead transitions. [2025-03-15 00:37:44,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 387 transitions, 3149 flow [2025-03-15 00:37:44,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:37:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:37:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1403 transitions. [2025-03-15 00:37:44,177 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6938674579624134 [2025-03-15 00:37:44,177 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, 82 predicate places. [2025-03-15 00:37:44,178 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 387 transitions, 3149 flow [2025-03-15 00:37:44,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.5) internal successors, (1335), 6 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:44,178 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:44,178 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:44,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:37:44,178 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:44,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:44,179 INFO L85 PathProgramCache]: Analyzing trace with hash -48707043, now seen corresponding path program 1 times [2025-03-15 00:37:44,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:44,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769214774] [2025-03-15 00:37:44,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:44,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:44,569 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:37:44,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:44,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769214774] [2025-03-15 00:37:44,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769214774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:44,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:44,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:37:44,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965617245] [2025-03-15 00:37:44,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:44,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:37:44,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:44,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:37:44,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:37:44,572 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 337 [2025-03-15 00:37:44,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 387 transitions, 3149 flow. Second operand has 6 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:44,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:44,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 337 [2025-03-15 00:37:44,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:45,188 INFO L124 PetriNetUnfolderBase]: 860/2851 cut-off events. [2025-03-15 00:37:45,189 INFO L125 PetriNetUnfolderBase]: For 8021/9034 co-relation queries the response was YES. [2025-03-15 00:37:45,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16783 conditions, 2851 events. 860/2851 cut-off events. For 8021/9034 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 16625 event pairs, 858 based on Foata normal form. 0/2564 useless extension candidates. Maximal degree in co-relation 15256. Up to 1948 conditions per place. [2025-03-15 00:37:45,201 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 116 selfloop transitions, 5 changer transitions 1/386 dead transitions. [2025-03-15 00:37:45,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 386 transitions, 3377 flow [2025-03-15 00:37:45,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:37:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:37:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1402 transitions. [2025-03-15 00:37:45,202 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6933728981206726 [2025-03-15 00:37:45,203 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, 86 predicate places. [2025-03-15 00:37:45,203 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 386 transitions, 3377 flow [2025-03-15 00:37:45,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:45,203 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:45,203 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:45,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:37:45,203 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:45,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:45,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1583322363, now seen corresponding path program 1 times [2025-03-15 00:37:45,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:45,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400687763] [2025-03-15 00:37:45,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:45,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:37:45,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:45,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400687763] [2025-03-15 00:37:45,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400687763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:37:45,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235465920] [2025-03-15 00:37:45,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:45,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:37:45,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:37:45,319 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:37:45,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-15 00:37:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:45,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 00:37:45,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:37:45,592 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:37:45,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:37:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:37:45,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235465920] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:37:45,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:37:45,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-15 00:37:45,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519435787] [2025-03-15 00:37:45,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:37:45,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:37:45,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:45,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:37:45,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-15 00:37:45,701 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 337 [2025-03-15 00:37:45,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 386 transitions, 3377 flow. Second operand has 10 states, 10 states have (on average 312.6) internal successors, (3126), 10 states have internal predecessors, (3126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:45,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:45,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 337 [2025-03-15 00:37:45,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:46,407 INFO L124 PetriNetUnfolderBase]: 860/2958 cut-off events. [2025-03-15 00:37:46,408 INFO L125 PetriNetUnfolderBase]: For 9801/10822 co-relation queries the response was YES. [2025-03-15 00:37:46,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17507 conditions, 2958 events. 860/2958 cut-off events. For 9801/10822 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15712 event pairs, 858 based on Foata normal form. 0/2671 useless extension candidates. Maximal degree in co-relation 15422. Up to 1996 conditions per place. [2025-03-15 00:37:46,419 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 50 selfloop transitions, 9 changer transitions 1/404 dead transitions. [2025-03-15 00:37:46,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 404 transitions, 3727 flow [2025-03-15 00:37:46,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:37:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:37:46,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2824 transitions. [2025-03-15 00:37:46,421 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9310913287174415 [2025-03-15 00:37:46,421 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, 94 predicate places. [2025-03-15 00:37:46,421 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 404 transitions, 3727 flow [2025-03-15 00:37:46,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 312.6) internal successors, (3126), 10 states have internal predecessors, (3126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:46,422 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:46,422 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:46,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-15 00:37:46,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:37:46,623 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:46,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:46,624 INFO L85 PathProgramCache]: Analyzing trace with hash -2121428933, now seen corresponding path program 2 times [2025-03-15 00:37:46,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:46,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138011199] [2025-03-15 00:37:46,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:37:46,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:46,673 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:37:46,674 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:37:46,816 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-03-15 00:37:46,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:46,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138011199] [2025-03-15 00:37:46,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138011199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:46,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:46,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:37:46,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188803712] [2025-03-15 00:37:46,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:46,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:37:46,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:46,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:37:46,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:37:46,818 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 337 [2025-03-15 00:37:46,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 404 transitions, 3727 flow. Second operand has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:46,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:46,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 337 [2025-03-15 00:37:46,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:48,463 INFO L124 PetriNetUnfolderBase]: 1524/4719 cut-off events. [2025-03-15 00:37:48,463 INFO L125 PetriNetUnfolderBase]: For 18499/20134 co-relation queries the response was YES. [2025-03-15 00:37:48,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32308 conditions, 4719 events. 1524/4719 cut-off events. For 18499/20134 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 30946 event pairs, 129 based on Foata normal form. 0/4259 useless extension candidates. Maximal degree in co-relation 30006. Up to 3342 conditions per place. [2025-03-15 00:37:48,489 INFO L140 encePairwiseOnDemand]: 314/337 looper letters, 311 selfloop transitions, 70 changer transitions 1/578 dead transitions. [2025-03-15 00:37:48,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 578 transitions, 7343 flow [2025-03-15 00:37:48,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:37:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:37:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1261 transitions. [2025-03-15 00:37:48,491 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6236399604352126 [2025-03-15 00:37:48,492 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, 99 predicate places. [2025-03-15 00:37:48,492 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 578 transitions, 7343 flow [2025-03-15 00:37:48,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:48,492 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:48,492 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:48,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 00:37:48,493 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:48,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:48,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1412189735, now seen corresponding path program 1 times [2025-03-15 00:37:48,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:48,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484588843] [2025-03-15 00:37:48,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:48,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:48,879 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 318 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:37:48,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:48,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484588843] [2025-03-15 00:37:48,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484588843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:37:48,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970658281] [2025-03-15 00:37:48,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:48,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:37:48,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:37:48,882 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:37:48,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-15 00:37:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:49,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-15 00:37:49,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:37:49,446 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 318 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:37:49,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:37:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 318 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:37:49,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970658281] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:37:49,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:37:49,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-15 00:37:49,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838779267] [2025-03-15 00:37:49,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:37:49,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-15 00:37:49,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:49,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-15 00:37:49,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-15 00:37:49,722 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 337 [2025-03-15 00:37:49,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 578 transitions, 7343 flow. Second operand has 18 states, 18 states have (on average 313.6666666666667) internal successors, (5646), 18 states have internal predecessors, (5646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:49,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:49,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 337 [2025-03-15 00:37:49,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:51,649 INFO L124 PetriNetUnfolderBase]: 1524/5119 cut-off events. [2025-03-15 00:37:51,649 INFO L125 PetriNetUnfolderBase]: For 22478/24485 co-relation queries the response was YES. [2025-03-15 00:37:51,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34910 conditions, 5119 events. 1524/5119 cut-off events. For 22478/24485 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 30885 event pairs, 115 based on Foata normal form. 0/4659 useless extension candidates. Maximal degree in co-relation 30245. Up to 3530 conditions per place. [2025-03-15 00:37:51,673 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 112 selfloop transitions, 21 changer transitions 1/642 dead transitions. [2025-03-15 00:37:51,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 642 transitions, 8721 flow [2025-03-15 00:37:51,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-15 00:37:51,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-15 00:37:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6574 transitions. [2025-03-15 00:37:51,677 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9289246856012434 [2025-03-15 00:37:51,677 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, 119 predicate places. [2025-03-15 00:37:51,677 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 642 transitions, 8721 flow [2025-03-15 00:37:51,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 313.6666666666667) internal successors, (5646), 18 states have internal predecessors, (5646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:51,679 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:51,679 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:51,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-15 00:37:51,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-15 00:37:51,880 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:51,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:51,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1854043303, now seen corresponding path program 2 times [2025-03-15 00:37:51,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:51,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097751156] [2025-03-15 00:37:51,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:37:51,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:51,966 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:37:51,966 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:37:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2447 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2447 trivial. 0 not checked. [2025-03-15 00:37:52,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:52,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097751156] [2025-03-15 00:37:52,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097751156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:37:52,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:37:52,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:37:52,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008111562] [2025-03-15 00:37:52,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:37:52,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:37:52,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:52,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:37:52,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:37:52,101 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 337 [2025-03-15 00:37:52,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 642 transitions, 8721 flow. Second operand has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:52,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:52,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 337 [2025-03-15 00:37:52,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:37:54,633 INFO L124 PetriNetUnfolderBase]: 1818/5745 cut-off events. [2025-03-15 00:37:54,634 INFO L125 PetriNetUnfolderBase]: For 30012/32685 co-relation queries the response was YES. [2025-03-15 00:37:54,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42827 conditions, 5745 events. 1818/5745 cut-off events. For 30012/32685 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 35339 event pairs, 204 based on Foata normal form. 0/5273 useless extension candidates. Maximal degree in co-relation 37844. Up to 3938 conditions per place. [2025-03-15 00:37:54,661 INFO L140 encePairwiseOnDemand]: 314/337 looper letters, 505 selfloop transitions, 134 changer transitions 1/942 dead transitions. [2025-03-15 00:37:54,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 942 transitions, 15551 flow [2025-03-15 00:37:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:37:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:37:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1569 transitions. [2025-03-15 00:37:54,663 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7759643916913946 [2025-03-15 00:37:54,663 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, 124 predicate places. [2025-03-15 00:37:54,663 INFO L471 AbstractCegarLoop]: Abstraction has has 461 places, 942 transitions, 15551 flow [2025-03-15 00:37:54,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:54,663 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:37:54,664 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:37:54,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 00:37:54,664 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:37:54,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:37:54,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1633501827, now seen corresponding path program 1 times [2025-03-15 00:37:54,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:37:54,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524169914] [2025-03-15 00:37:54,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:54,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:37:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:55,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2447 backedges. 0 proven. 2212 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:37:55,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:37:55,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524169914] [2025-03-15 00:37:55,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524169914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:37:55,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511972878] [2025-03-15 00:37:55,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:37:55,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:37:55,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:37:55,929 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:37:55,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-15 00:37:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:37:56,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 3333 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-15 00:37:56,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:37:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2447 backedges. 0 proven. 2212 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:37:57,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:37:57,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2447 backedges. 0 proven. 2212 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-15 00:37:57,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511972878] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:37:57,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:37:57,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-15 00:37:57,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063729491] [2025-03-15 00:37:57,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:37:57,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-15 00:37:57,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:37:57,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-15 00:37:57,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-15 00:37:57,686 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 337 [2025-03-15 00:37:57,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 942 transitions, 15551 flow. Second operand has 23 states, 23 states have (on average 314.30434782608694) internal successors, (7229), 23 states have internal predecessors, (7229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:37:57,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:37:57,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 337 [2025-03-15 00:37:57,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:38:01,011 INFO L124 PetriNetUnfolderBase]: 1818/6060 cut-off events. [2025-03-15 00:38:01,011 INFO L125 PetriNetUnfolderBase]: For 35033/37853 co-relation queries the response was YES. [2025-03-15 00:38:01,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45128 conditions, 6060 events. 1818/6060 cut-off events. For 35033/37853 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 35363 event pairs, 194 based on Foata normal form. 0/5588 useless extension candidates. Maximal degree in co-relation 38112. Up to 4079 conditions per place. [2025-03-15 00:38:01,038 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 163 selfloop transitions, 30 changer transitions 1/990 dead transitions. [2025-03-15 00:38:01,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 990 transitions, 16927 flow [2025-03-15 00:38:01,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-15 00:38:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-15 00:38:01,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9384 transitions. [2025-03-15 00:38:01,042 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9281899109792285 [2025-03-15 00:38:01,043 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, 153 predicate places. [2025-03-15 00:38:01,043 INFO L471 AbstractCegarLoop]: Abstraction has has 490 places, 990 transitions, 16927 flow [2025-03-15 00:38:01,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 314.30434782608694) internal successors, (7229), 23 states have internal predecessors, (7229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:38:01,044 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:38:01,045 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:38:01,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-15 00:38:01,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-15 00:38:01,245 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:38:01,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:38:01,247 INFO L85 PathProgramCache]: Analyzing trace with hash 254546311, now seen corresponding path program 2 times [2025-03-15 00:38:01,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:38:01,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638332556] [2025-03-15 00:38:01,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:38:01,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:38:01,352 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:38:01,352 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:38:01,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4970 trivial. 0 not checked. [2025-03-15 00:38:01,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:38:01,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638332556] [2025-03-15 00:38:01,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638332556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:38:01,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:38:01,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:38:01,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190223468] [2025-03-15 00:38:01,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:38:01,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:38:01,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:38:01,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:38:01,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:38:01,496 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 337 [2025-03-15 00:38:01,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 990 transitions, 16927 flow. Second operand has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:38:01,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:38:01,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 337 [2025-03-15 00:38:01,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:38:05,656 INFO L124 PetriNetUnfolderBase]: 2185/6914 cut-off events. [2025-03-15 00:38:05,656 INFO L125 PetriNetUnfolderBase]: For 55827/60660 co-relation queries the response was YES. [2025-03-15 00:38:05,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56099 conditions, 6914 events. 2185/6914 cut-off events. For 55827/60660 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 42337 event pairs, 315 based on Foata normal form. 0/6404 useless extension candidates. Maximal degree in co-relation 48629. Up to 4636 conditions per place. [2025-03-15 00:38:05,695 INFO L140 encePairwiseOnDemand]: 314/337 looper letters, 794 selfloop transitions, 135 changer transitions 42/1291 dead transitions. [2025-03-15 00:38:05,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 1291 transitions, 25099 flow [2025-03-15 00:38:05,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:38:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:38:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1570 transitions. [2025-03-15 00:38:05,697 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7764589515331355 [2025-03-15 00:38:05,697 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, 158 predicate places. [2025-03-15 00:38:05,697 INFO L471 AbstractCegarLoop]: Abstraction has has 495 places, 1291 transitions, 25099 flow [2025-03-15 00:38:05,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:38:05,698 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:38:05,698 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:38:05,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 00:38:05,698 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:38:05,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:38:05,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1996385328, now seen corresponding path program 1 times [2025-03-15 00:38:05,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:38:05,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568766144] [2025-03-15 00:38:05,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:38:05,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:38:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:38:08,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4970 trivial. 0 not checked. [2025-03-15 00:38:08,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:38:08,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568766144] [2025-03-15 00:38:08,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568766144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:38:08,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:38:08,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:38:08,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596124205] [2025-03-15 00:38:08,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:38:08,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:38:08,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:38:08,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:38:08,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:38:08,801 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 337 [2025-03-15 00:38:08,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 1291 transitions, 25099 flow. Second operand has 6 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:38:08,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:38:08,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 337 [2025-03-15 00:38:08,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:38:13,692 INFO L124 PetriNetUnfolderBase]: 2585/7829 cut-off events. [2025-03-15 00:38:13,692 INFO L125 PetriNetUnfolderBase]: For 78877/83787 co-relation queries the response was YES. [2025-03-15 00:38:13,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67344 conditions, 7829 events. 2585/7829 cut-off events. For 78877/83787 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 49776 event pairs, 357 based on Foata normal form. 7/7301 useless extension candidates. Maximal degree in co-relation 59422. Up to 5120 conditions per place. [2025-03-15 00:38:13,739 INFO L140 encePairwiseOnDemand]: 318/337 looper letters, 942 selfloop transitions, 115 changer transitions 42/1418 dead transitions. [2025-03-15 00:38:13,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 1418 transitions, 30275 flow [2025-03-15 00:38:13,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:38:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:38:13,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1482 transitions. [2025-03-15 00:38:13,740 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7329376854599406 [2025-03-15 00:38:13,741 INFO L298 CegarLoopForPetriNet]: 337 programPoint places, 163 predicate places. [2025-03-15 00:38:13,741 INFO L471 AbstractCegarLoop]: Abstraction has has 500 places, 1418 transitions, 30275 flow [2025-03-15 00:38:13,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:38:13,741 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:38:13,741 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:38:13,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 00:38:13,742 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:38:13,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:38:13,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1833676562, now seen corresponding path program 1 times [2025-03-15 00:38:13,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:38:13,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105968612] [2025-03-15 00:38:13,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:38:13,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:38:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:38:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 1291 proven. 3341 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-15 00:38:41,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:38:41,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105968612] [2025-03-15 00:38:41,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105968612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:38:41,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773159243] [2025-03-15 00:38:41,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:38:41,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:38:41,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:38:41,966 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 00:38:41,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-15 00:38:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:38:43,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 4602 conjuncts, 200 conjuncts are in the unsatisfiable core [2025-03-15 00:38:43,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:38:43,545 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 00:38:43,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 00:38:43,727 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-15 00:38:43,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-15 00:38:44,504 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-15 00:38:44,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-03-15 00:38:45,052 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-15 00:38:45,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-03-15 00:38:46,744 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-15 00:38:46,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-15 00:38:47,547 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-15 00:38:47,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-15 00:38:49,101 INFO L349 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2025-03-15 00:38:49,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2025-03-15 00:38:50,283 INFO L349 Elim1Store]: treesize reduction 90, result has 33.8 percent of original size [2025-03-15 00:38:50,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 69 [2025-03-15 00:38:53,749 INFO L349 Elim1Store]: treesize reduction 108, result has 33.7 percent of original size [2025-03-15 00:38:53,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 42 treesize of output 81 [2025-03-15 00:38:56,556 INFO L349 Elim1Store]: treesize reduction 140, result has 31.4 percent of original size [2025-03-15 00:38:56,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 49 treesize of output 88 [2025-03-15 00:39:03,057 INFO L349 Elim1Store]: treesize reduction 98, result has 26.9 percent of original size [2025-03-15 00:39:03,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 62 [2025-03-15 00:39:06,215 INFO L349 Elim1Store]: treesize reduction 98, result has 26.9 percent of original size [2025-03-15 00:39:06,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 62 [2025-03-15 00:39:15,717 INFO L349 Elim1Store]: treesize reduction 126, result has 33.7 percent of original size [2025-03-15 00:39:15,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 47 treesize of output 93 [2025-03-15 00:39:22,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-15 00:39:25,164 INFO L349 Elim1Store]: treesize reduction 162, result has 34.4 percent of original size [2025-03-15 00:39:25,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 29 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 16 case distinctions, treesize of input 58 treesize of output 117 [2025-03-15 00:39:32,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 87 [2025-03-15 00:39:33,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 87 [2025-03-15 00:39:44,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 45 [2025-03-15 00:40:27,521 INFO L349 Elim1Store]: treesize reduction 162, result has 33.6 percent of original size [2025-03-15 00:40:27,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 38 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 57 treesize of output 117 [2025-03-15 00:41:21,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-15 00:41:36,777 INFO L349 Elim1Store]: treesize reduction 198, result has 34.2 percent of original size [2025-03-15 00:41:36,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 47 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 68 treesize of output 141 [2025-03-15 00:42:21,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 103 [2025-03-15 00:42:23,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 103 [2025-03-15 00:42:50,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 50 [2025-03-15 00:43:54,459 INFO L349 Elim1Store]: treesize reduction 220, result has 31.3 percent of original size [2025-03-15 00:43:54,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 57 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 22 case distinctions, treesize of input 69 treesize of output 136 [2025-03-15 00:45:06,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-15 00:45:26,635 INFO L349 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2025-03-15 00:45:26,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 67 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 22 case distinctions, treesize of input 67 treesize of output 141 [2025-03-15 00:46:14,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 54 [2025-03-15 00:46:17,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 63 [2025-03-15 00:47:29,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 51 [2025-03-15 00:49:59,575 INFO L349 Elim1Store]: treesize reduction 240, result has 31.2 percent of original size [2025-03-15 00:49:59,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 24 case distinctions, treesize of input 74 treesize of output 148 [2025-03-15 00:50:11,028 INFO L349 Elim1Store]: treesize reduction 240, result has 31.2 percent of original size [2025-03-15 00:50:11,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 24 case distinctions, treesize of input 74 treesize of output 148 [2025-03-15 00:50:34,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-15 00:50:42,919 INFO L349 Elim1Store]: treesize reduction 48, result has 50.5 percent of original size [2025-03-15 00:50:42,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 12 case distinctions, treesize of input 66 treesize of output 88 [2025-03-15 00:50:43,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-03-15 00:50:43,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:50:43,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2025-03-15 00:50:43,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:50:43,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2025-03-15 00:50:43,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2025-03-15 00:50:43,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 2451 proven. 2196 refuted. 56 times theorem prover too weak. 267 trivial. 0 not checked. [2025-03-15 00:50:43,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:50:43,924 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (forall ((v_ArrVal_9857 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_9857) |c_~#c~0.base|) (+ 2 |c_~#c~0.offset| .cse0)) 0)) (forall ((v_ArrVal_9857 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_9857) |c_~#c~0.base|) (+ 3 |c_~#c~0.offset| .cse0)) 0)) (forall ((v_ArrVal_9857 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_9857) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse0)) 0)) (forall ((v_ArrVal_9857 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_9857) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse0 1)) 0)))) is different from false [2025-03-15 00:50:44,053 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse2 (+ 3 |c_~#c~0.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_~#c~0.base| (store (select |c_#race| |c_~#c~0.base|) .cse2 0)))) (and (forall ((v_ArrVal_9857 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_9857) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1)) 0)) (forall ((v_ArrVal_9857 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_9857) |c_~#c~0.base|) .cse2) 0)) (forall ((v_ArrVal_9857 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_9857) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1 1)) 0)) (forall ((v_ArrVal_9857 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_9857) |c_~#c~0.base|) (+ 2 |c_~#c~0.offset| .cse1)) 0)))))) is different from false [2025-03-15 00:50:44,833 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse1 (+ |c_~#c~0.offset| .cse3 1)) (.cse4 (+ 2 |c_~#c~0.offset| .cse3)) (.cse2 (+ 3 |c_~#c~0.offset| .cse3))) (let ((.cse0 (store |c_#race| |c_~#c~0.base| (store (store (store (select |c_#race| |c_~#c~0.base|) .cse1 0) .cse4 0) .cse2 0)))) (and (forall ((v_ArrVal_9857 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_9857) |c_~#c~0.base|) .cse1) 0)) (forall ((v_ArrVal_9857 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_9857) |c_~#c~0.base|) .cse2) 0)) (forall ((v_ArrVal_9857 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_9857) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse3)) 0)) (forall ((v_ArrVal_9857 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_9857) |c_~#c~0.base|) .cse4) 0)))))) is different from false [2025-03-15 00:50:45,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:50:45,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2025-03-15 00:50:45,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:50:45,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39 [2025-03-15 00:50:45,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2025-03-15 00:50:45,376 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-15 00:50:45,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2025-03-15 00:50:45,380 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-15 00:50:45,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-03-15 00:50:45,385 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-15 00:50:45,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-03-15 00:50:47,617 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:50:47,618 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 Received shutdown request... [2025-03-15 00:51:48,595 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 00:51:48,595 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 00:51:48,603 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (24 of 25 remaining) [2025-03-15 00:51:48,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-15 00:51:48,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:51:48,804 WARN L596 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 1222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-13-1 term,while PolyPacSimplificationTermWalker was simplifying 13 xjuncts wrt. a ATOM-1 context. [2025-03-15 00:51:48,806 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2025-03-15 00:51:48,806 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2025-03-15 00:51:48,806 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2025-03-15 00:51:48,806 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2025-03-15 00:51:48,806 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2025-03-15 00:51:48,806 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2025-03-15 00:51:48,806 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2025-03-15 00:51:48,806 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2025-03-15 00:51:48,806 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2025-03-15 00:51:48,806 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2025-03-15 00:51:48,806 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2025-03-15 00:51:48,806 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 25 remaining) [2025-03-15 00:51:48,807 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2025-03-15 00:51:48,807 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2025-03-15 00:51:48,807 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2025-03-15 00:51:48,807 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2025-03-15 00:51:48,807 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2025-03-15 00:51:48,807 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2025-03-15 00:51:48,807 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2025-03-15 00:51:48,807 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2025-03-15 00:51:48,807 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2025-03-15 00:51:48,807 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2025-03-15 00:51:48,807 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2025-03-15 00:51:48,807 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2025-03-15 00:51:48,807 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:51:48,812 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:51:48,812 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:51:48,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:51:48 BasicIcfg [2025-03-15 00:51:48,815 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:51:48,815 INFO L158 Benchmark]: Toolchain (without parser) took 856977.26ms. Allocated memory was 71.3MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 42.5MB in the beginning and 683.9MB in the end (delta: -641.4MB). Peak memory consumption was 999.9MB. Max. memory is 8.0GB. [2025-03-15 00:51:48,815 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 71.3MB. Free memory is still 35.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:51:48,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.88ms. Allocated memory is still 71.3MB. Free memory was 42.4MB in the beginning and 24.0MB in the end (delta: 18.3MB). Peak memory consumption was 31.7MB. Max. memory is 8.0GB. [2025-03-15 00:51:48,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.11ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 24.0MB in the beginning and 57.8MB in the end (delta: -33.8MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. [2025-03-15 00:51:48,816 INFO L158 Benchmark]: Boogie Preprocessor took 45.73ms. Allocated memory is still 88.1MB. Free memory was 57.8MB in the beginning and 54.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:51:48,816 INFO L158 Benchmark]: RCFGBuilder took 624.07ms. Allocated memory is still 88.1MB. Free memory was 54.3MB in the beginning and 47.6MB in the end (delta: 6.7MB). Peak memory consumption was 32.6MB. Max. memory is 8.0GB. [2025-03-15 00:51:48,816 INFO L158 Benchmark]: TraceAbstraction took 855733.66ms. Allocated memory was 88.1MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 46.7MB in the beginning and 683.9MB in the end (delta: -637.3MB). Peak memory consumption was 986.4MB. Max. memory is 8.0GB. [2025-03-15 00:51:48,817 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 71.3MB. Free memory is still 35.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 509.88ms. Allocated memory is still 71.3MB. Free memory was 42.4MB in the beginning and 24.0MB in the end (delta: 18.3MB). Peak memory consumption was 31.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.11ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 24.0MB in the beginning and 57.8MB in the end (delta: -33.8MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.73ms. Allocated memory is still 88.1MB. Free memory was 57.8MB in the beginning and 54.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 624.07ms. Allocated memory is still 88.1MB. Free memory was 54.3MB in the beginning and 47.6MB in the end (delta: 6.7MB). Peak memory consumption was 32.6MB. Max. memory is 8.0GB. * TraceAbstraction took 855733.66ms. Allocated memory was 88.1MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 46.7MB in the beginning and 683.9MB in the end (delta: -637.3MB). Peak memory consumption was 986.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1268]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-13-1 term,while PolyPacSimplificationTermWalker was simplifying 13 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1238]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-13-1 term,while PolyPacSimplificationTermWalker was simplifying 13 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1268]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-13-1 term,while PolyPacSimplificationTermWalker was simplifying 13 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-13-1 term,while PolyPacSimplificationTermWalker was simplifying 13 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1269]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-13-1 term,while PolyPacSimplificationTermWalker was simplifying 13 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1263]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-13-1 term,while PolyPacSimplificationTermWalker was simplifying 13 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1238]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-13-1 term,while PolyPacSimplificationTermWalker was simplifying 13 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-13-1 term,while PolyPacSimplificationTermWalker was simplifying 13 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1264]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-13-1 term,while PolyPacSimplificationTermWalker was simplifying 13 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1243]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-13-1 term,while PolyPacSimplificationTermWalker was simplifying 13 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1244]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-13-1 term,while PolyPacSimplificationTermWalker was simplifying 13 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1245]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-13-1 term,while PolyPacSimplificationTermWalker was simplifying 13 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1266]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 1222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-13-1 term,while PolyPacSimplificationTermWalker was simplifying 13 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1238]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-13-1 term,while PolyPacSimplificationTermWalker was simplifying 13 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-13-1 term,while PolyPacSimplificationTermWalker was simplifying 13 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1251]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-13-1 term,while PolyPacSimplificationTermWalker was simplifying 13 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1243]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-13-1 term,while PolyPacSimplificationTermWalker was simplifying 13 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1244]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-13-1 term,while PolyPacSimplificationTermWalker was simplifying 13 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 1245]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 1222 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-13-1 term,while PolyPacSimplificationTermWalker was simplifying 13 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 425 locations, 25 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 855.6s, OverallIterations: 20, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 25.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 493 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 493 mSDsluCounter, 1456 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5265 IncrementalHoareTripleChecker+Invalid, 5414 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 1372 mSDtfsCounter, 5265 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4180 GetRequests, 3954 SyntacticMatches, 22 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30275occurred in iteration=19, InterpolantAutomatonStates: 192, 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.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 9264 NumberOfCodeBlocks, 6914 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 11228 ConstructedInterpolants, 0 QuantifiedInterpolants, 19561 SizeOfPredicates, 44 NumberOfNonLiveVariables, 6622 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 31 InterpolantComputations, 13 PerfectInterpolantSequences, 16378/24364 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown