/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_11-arraylist_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:34:29,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:34:29,473 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:34:29,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:34:29,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:34:29,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:34:29,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:34:29,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:34:29,497 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:34:29,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:34:29,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:34:29,498 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:34:29,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:34:29,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:34:29,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:34:29,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:34:29,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:34:29,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:34:29,499 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:34:29,499 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:34:29,499 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:34:29,499 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:34:29,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:34:29,500 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:34:29,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:34:29,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:34:29,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:34:29,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:34:29,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:34:29,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:34:29,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:34:29,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:34:29,500 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:34:29,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:34:29,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:34:29,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:34:29,773 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:34:29,774 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:34:29,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_nr.i [2025-03-15 00:34:31,007 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cebd937b/882fb20c3afc416b8b489ecc074da3db/FLAGc6af6fa70 [2025-03-15 00:34:31,325 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:34:31,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_11-arraylist_nr.i [2025-03-15 00:34:31,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cebd937b/882fb20c3afc416b8b489ecc074da3db/FLAGc6af6fa70 [2025-03-15 00:34:31,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cebd937b/882fb20c3afc416b8b489ecc074da3db [2025-03-15 00:34:31,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:34:31,377 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:34:31,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:34:31,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:34:31,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:34:31,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:34:31" (1/1) ... [2025-03-15 00:34:31,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42b15626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:34:31, skipping insertion in model container [2025-03-15 00:34:31,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:34:31" (1/1) ... [2025-03-15 00:34:31,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:34:31,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:34:31,926 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:34:31,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:34:32,080 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:34:32,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:34:32 WrapperNode [2025-03-15 00:34:32,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:34:32,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:34:32,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:34:32,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:34:32,085 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:34:32" (1/1) ... [2025-03-15 00:34:32,104 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:34:32" (1/1) ... [2025-03-15 00:34:32,152 INFO L138 Inliner]: procedures = 372, calls = 88, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 294 [2025-03-15 00:34:32,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:34:32,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:34:32,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:34:32,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:34:32,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:34:32" (1/1) ... [2025-03-15 00:34:32,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:34:32" (1/1) ... [2025-03-15 00:34:32,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:34:32" (1/1) ... [2025-03-15 00:34:32,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:34:32" (1/1) ... [2025-03-15 00:34:32,184 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:34:32" (1/1) ... [2025-03-15 00:34:32,186 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:34:32" (1/1) ... [2025-03-15 00:34:32,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:34:32" (1/1) ... [2025-03-15 00:34:32,191 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:34:32" (1/1) ... [2025-03-15 00:34:32,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:34:32" (1/1) ... [2025-03-15 00:34:32,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:34:32,196 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:34:32,196 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:34:32,196 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:34:32,197 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:34:32" (1/1) ... [2025-03-15 00:34:32,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:34:32,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:34:32,231 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:34:32,237 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:34:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-15 00:34:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-15 00:34:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:34:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:34:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:34:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:34:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 00:34:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:34:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-15 00:34:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 00:34:32,251 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 00:34:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:34:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:34:32,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:34:32,252 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:34:32,377 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:34:32,379 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:34:32,843 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:34:32,844 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:34:32,863 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:34:32,863 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:34:32,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:34:32 BoogieIcfgContainer [2025-03-15 00:34:32,863 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:34:32,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:34:32,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:34:32,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:34:32,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:34:31" (1/3) ... [2025-03-15 00:34:32,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4a5021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:34:32, skipping insertion in model container [2025-03-15 00:34:32,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:34:32" (2/3) ... [2025-03-15 00:34:32,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4a5021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:34:32, skipping insertion in model container [2025-03-15 00:34:32,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:34:32" (3/3) ... [2025-03-15 00:34:32,870 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_11-arraylist_nr.i [2025-03-15 00:34:32,880 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:34:32,885 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_11-arraylist_nr.i that has 2 procedures, 336 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-03-15 00:34:32,885 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:34:32,960 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 00:34:33,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:34:33,021 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;@543af86e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:34:33,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-15 00:34:33,079 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:34:33,079 INFO L124 PetriNetUnfolderBase]: 3/130 cut-off events. [2025-03-15 00:34:33,081 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:34:33,081 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:33,081 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] [2025-03-15 00:34:33,082 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:34:33,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:33,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1083417160, now seen corresponding path program 1 times [2025-03-15 00:34:33,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:33,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063802452] [2025-03-15 00:34:33,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:34:33,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:34:33,456 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:34:33,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:33,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063802452] [2025-03-15 00:34:33,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063802452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:33,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:33,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:34:33,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678563609] [2025-03-15 00:34:33,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:33,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:34:33,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:33,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:34:33,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:34:33,489 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 339 [2025-03-15 00:34:33,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 339 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 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:34:33,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:33,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 339 [2025-03-15 00:34:33,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:33,627 INFO L124 PetriNetUnfolderBase]: 8/416 cut-off events. [2025-03-15 00:34:33,628 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 00:34:33,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 416 events. 8/416 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 872 event pairs, 6 based on Foata normal form. 4/388 useless extension candidates. Maximal degree in co-relation 225. Up to 27 conditions per place. [2025-03-15 00:34:33,636 INFO L140 encePairwiseOnDemand]: 334/339 looper letters, 16 selfloop transitions, 2 changer transitions 1/340 dead transitions. [2025-03-15 00:34:33,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 340 transitions, 719 flow [2025-03-15 00:34:33,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:34:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:34:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 990 transitions. [2025-03-15 00:34:33,651 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9734513274336283 [2025-03-15 00:34:33,654 INFO L298 CegarLoopForPetriNet]: 339 programPoint places, 1 predicate places. [2025-03-15 00:34:33,654 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 340 transitions, 719 flow [2025-03-15 00:34:33,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 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:34:33,655 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:33,655 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:34:33,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:34:33,656 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:34:33,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:33,656 INFO L85 PathProgramCache]: Analyzing trace with hash 709935305, now seen corresponding path program 1 times [2025-03-15 00:34:33,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:33,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474131856] [2025-03-15 00:34:33,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:34:33,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:34:33,884 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:34:33,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:33,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474131856] [2025-03-15 00:34:33,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474131856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:34:33,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272429161] [2025-03-15 00:34:33,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:34:33,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:34:33,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:34:33,888 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:34:33,889 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:34:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:34:33,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 00:34:33,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:34:34,045 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:34:34,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:34:34,084 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:34:34,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272429161] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:34:34,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:34:34,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-15 00:34:34,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668267073] [2025-03-15 00:34:34,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:34:34,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:34:34,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:34,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:34:34,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-15 00:34:34,094 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 339 [2025-03-15 00:34:34,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 340 transitions, 719 flow. Second operand has 10 states, 10 states have (on average 324.1) internal successors, (3241), 10 states have internal predecessors, (3241), 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:34:34,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:34,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 339 [2025-03-15 00:34:34,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:34,249 INFO L124 PetriNetUnfolderBase]: 8/423 cut-off events. [2025-03-15 00:34:34,249 INFO L125 PetriNetUnfolderBase]: For 17/31 co-relation queries the response was YES. [2025-03-15 00:34:34,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 423 events. 8/423 cut-off events. For 17/31 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 865 event pairs, 6 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 257. Up to 32 conditions per place. [2025-03-15 00:34:34,252 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 17 selfloop transitions, 9 changer transitions 1/347 dead transitions. [2025-03-15 00:34:34,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 347 transitions, 795 flow [2025-03-15 00:34:34,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:34:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:34:34,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2926 transitions. [2025-03-15 00:34:34,260 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9590298262864635 [2025-03-15 00:34:34,260 INFO L298 CegarLoopForPetriNet]: 339 programPoint places, 9 predicate places. [2025-03-15 00:34:34,260 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 347 transitions, 795 flow [2025-03-15 00:34:34,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 324.1) internal successors, (3241), 10 states have internal predecessors, (3241), 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:34:34,265 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:34,265 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] [2025-03-15 00:34:34,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-15 00:34:34,465 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:34:34,466 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:34:34,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:34,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1827217961, now seen corresponding path program 2 times [2025-03-15 00:34:34,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:34,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978282879] [2025-03-15 00:34:34,467 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:34:34,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:34,506 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:34:34,506 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:34:34,926 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:34:34,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:34,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978282879] [2025-03-15 00:34:34,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978282879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:34,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:34,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:34:34,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046520398] [2025-03-15 00:34:34,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:34,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:34:34,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:34,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:34:34,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:34:34,930 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 339 [2025-03-15 00:34:34,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 347 transitions, 795 flow. Second operand has 6 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 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:34:34,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:34,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 339 [2025-03-15 00:34:34,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:35,616 INFO L124 PetriNetUnfolderBase]: 764/2493 cut-off events. [2025-03-15 00:34:35,617 INFO L125 PetriNetUnfolderBase]: For 366/384 co-relation queries the response was YES. [2025-03-15 00:34:35,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4444 conditions, 2493 events. 764/2493 cut-off events. For 366/384 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 14907 event pairs, 762 based on Foata normal form. 0/2215 useless extension candidates. Maximal degree in co-relation 4110. Up to 1640 conditions per place. [2025-03-15 00:34:35,631 INFO L140 encePairwiseOnDemand]: 327/339 looper letters, 117 selfloop transitions, 10 changer transitions 1/345 dead transitions. [2025-03-15 00:34:35,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 345 transitions, 1045 flow [2025-03-15 00:34:35,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:34:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:34:35,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1377 transitions. [2025-03-15 00:34:35,635 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6769911504424779 [2025-03-15 00:34:35,636 INFO L298 CegarLoopForPetriNet]: 339 programPoint places, 12 predicate places. [2025-03-15 00:34:35,636 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 345 transitions, 1045 flow [2025-03-15 00:34:35,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 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:34:35,637 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:35,637 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] [2025-03-15 00:34:35,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:34:35,637 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:34:35,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:35,638 INFO L85 PathProgramCache]: Analyzing trace with hash -455748363, now seen corresponding path program 1 times [2025-03-15 00:34:35,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:35,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657400903] [2025-03-15 00:34:35,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:34:35,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:34:35,701 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:34:35,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:35,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657400903] [2025-03-15 00:34:35,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657400903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:35,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:35,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 00:34:35,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283758308] [2025-03-15 00:34:35,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:35,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:34:35,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:35,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:34:35,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:34:35,705 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 339 [2025-03-15 00:34:35,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 345 transitions, 1045 flow. Second operand has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 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:34:35,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:35,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 339 [2025-03-15 00:34:35,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:36,297 INFO L124 PetriNetUnfolderBase]: 764/2604 cut-off events. [2025-03-15 00:34:36,297 INFO L125 PetriNetUnfolderBase]: For 733/761 co-relation queries the response was YES. [2025-03-15 00:34:36,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4791 conditions, 2604 events. 764/2604 cut-off events. For 733/761 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 14929 event pairs, 762 based on Foata normal form. 0/2319 useless extension candidates. Maximal degree in co-relation 4238. Up to 1698 conditions per place. [2025-03-15 00:34:36,309 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 42 selfloop transitions, 2 changer transitions 1/362 dead transitions. [2025-03-15 00:34:36,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 362 transitions, 1191 flow [2025-03-15 00:34:36,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:34:36,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:34:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2025-03-15 00:34:36,312 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9587020648967551 [2025-03-15 00:34:36,312 INFO L298 CegarLoopForPetriNet]: 339 programPoint places, 14 predicate places. [2025-03-15 00:34:36,313 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 362 transitions, 1191 flow [2025-03-15 00:34:36,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 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:34:36,313 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:36,313 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, 1, 1] [2025-03-15 00:34:36,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:34:36,314 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:34:36,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:36,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1532074012, now seen corresponding path program 1 times [2025-03-15 00:34:36,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:36,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421648032] [2025-03-15 00:34:36,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:34:36,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:34:36,513 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:34:36,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:36,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421648032] [2025-03-15 00:34:36,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421648032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:34:36,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204712445] [2025-03-15 00:34:36,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:34:36,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:34:36,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:34:36,516 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:34:36,517 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:34:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:34:36,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-15 00:34:36,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:34:36,651 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:34:36,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:34:36,732 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:34:36,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204712445] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:34:36,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:34:36,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-15 00:34:36,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114533323] [2025-03-15 00:34:36,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:34:36,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-15 00:34:36,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:36,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-15 00:34:36,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-15 00:34:36,740 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 339 [2025-03-15 00:34:36,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 362 transitions, 1191 flow. Second operand has 18 states, 18 states have (on average 324.27777777777777) internal successors, (5837), 18 states have internal predecessors, (5837), 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:34:36,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:36,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 339 [2025-03-15 00:34:36,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:37,265 INFO L124 PetriNetUnfolderBase]: 764/2624 cut-off events. [2025-03-15 00:34:37,266 INFO L125 PetriNetUnfolderBase]: For 1215/1247 co-relation queries the response was YES. [2025-03-15 00:34:37,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5017 conditions, 2624 events. 764/2624 cut-off events. For 1215/1247 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 14955 event pairs, 762 based on Foata normal form. 0/2339 useless extension candidates. Maximal degree in co-relation 4366. Up to 1698 conditions per place. [2025-03-15 00:34:37,278 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 25 selfloop transitions, 21 changer transitions 1/382 dead transitions. [2025-03-15 00:34:37,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 382 transitions, 1395 flow [2025-03-15 00:34:37,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-15 00:34:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-15 00:34:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6812 transitions. [2025-03-15 00:34:37,289 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9568759657255232 [2025-03-15 00:34:37,292 INFO L298 CegarLoopForPetriNet]: 339 programPoint places, 34 predicate places. [2025-03-15 00:34:37,292 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 382 transitions, 1395 flow [2025-03-15 00:34:37,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 324.27777777777777) internal successors, (5837), 18 states have internal predecessors, (5837), 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:34:37,297 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:37,297 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] [2025-03-15 00:34:37,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-15 00:34:37,502 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:34:37,502 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:34:37,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:37,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1996819748, now seen corresponding path program 2 times [2025-03-15 00:34:37,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:37,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948630254] [2025-03-15 00:34:37,504 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:34:37,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:37,533 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:34:37,533 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:34:37,838 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:34:37,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:37,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948630254] [2025-03-15 00:34:37,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948630254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:37,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:37,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:34:37,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835868842] [2025-03-15 00:34:37,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:37,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:34:37,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:37,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:34:37,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:34:37,841 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 339 [2025-03-15 00:34:37,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 382 transitions, 1395 flow. Second operand has 6 states, 6 states have (on average 210.5) internal successors, (1263), 6 states have internal predecessors, (1263), 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:34:37,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:37,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 339 [2025-03-15 00:34:37,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:38,636 INFO L124 PetriNetUnfolderBase]: 764/2620 cut-off events. [2025-03-15 00:34:38,637 INFO L125 PetriNetUnfolderBase]: For 1589/1783 co-relation queries the response was YES. [2025-03-15 00:34:38,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6723 conditions, 2620 events. 764/2620 cut-off events. For 1589/1783 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 14936 event pairs, 762 based on Foata normal form. 0/2339 useless extension candidates. Maximal degree in co-relation 5946. Up to 1694 conditions per place. [2025-03-15 00:34:38,650 INFO L140 encePairwiseOnDemand]: 327/339 looper letters, 127 selfloop transitions, 10 changer transitions 1/380 dead transitions. [2025-03-15 00:34:38,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 380 transitions, 1661 flow [2025-03-15 00:34:38,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:34:38,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:34:38,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1375 transitions. [2025-03-15 00:34:38,654 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.676007866273353 [2025-03-15 00:34:38,654 INFO L298 CegarLoopForPetriNet]: 339 programPoint places, 37 predicate places. [2025-03-15 00:34:38,654 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 380 transitions, 1661 flow [2025-03-15 00:34:38,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.5) internal successors, (1263), 6 states have internal predecessors, (1263), 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:34:38,655 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:38,655 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, 1, 1] [2025-03-15 00:34:38,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:34:38,655 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:34:38,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:38,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1228523766, now seen corresponding path program 1 times [2025-03-15 00:34:38,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:38,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702245598] [2025-03-15 00:34:38,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:34:38,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:34:38,956 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:34:38,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:38,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702245598] [2025-03-15 00:34:38,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702245598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:34:38,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785658152] [2025-03-15 00:34:38,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:34:38,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:34:38,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:34:38,959 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:34:38,960 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:34:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:34:39,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-15 00:34:39,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:34:39,152 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:34:39,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:34:39,316 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:34:39,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785658152] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:34:39,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:34:39,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-15 00:34:39,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114023454] [2025-03-15 00:34:39,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:34:39,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-15 00:34:39,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:39,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-15 00:34:39,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-15 00:34:39,322 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 339 [2025-03-15 00:34:39,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 380 transitions, 1661 flow. Second operand has 23 states, 23 states have (on average 324.4347826086956) internal successors, (7462), 23 states have internal predecessors, (7462), 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:34:39,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:39,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 339 [2025-03-15 00:34:39,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:39,948 INFO L124 PetriNetUnfolderBase]: 764/2635 cut-off events. [2025-03-15 00:34:39,949 INFO L125 PetriNetUnfolderBase]: For 2292/2496 co-relation queries the response was YES. [2025-03-15 00:34:39,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6965 conditions, 2635 events. 764/2635 cut-off events. For 2292/2496 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 14919 event pairs, 762 based on Foata normal form. 0/2354 useless extension candidates. Maximal degree in co-relation 6074. Up to 1694 conditions per place. [2025-03-15 00:34:39,958 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 31 selfloop transitions, 30 changer transitions 1/395 dead transitions. [2025-03-15 00:34:39,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 395 transitions, 1897 flow [2025-03-15 00:34:39,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-15 00:34:39,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-15 00:34:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9724 transitions. [2025-03-15 00:34:39,970 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9561455260570305 [2025-03-15 00:34:39,971 INFO L298 CegarLoopForPetriNet]: 339 programPoint places, 66 predicate places. [2025-03-15 00:34:39,971 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 395 transitions, 1897 flow [2025-03-15 00:34:39,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 324.4347826086956) internal successors, (7462), 23 states have internal predecessors, (7462), 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:34:39,973 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:39,973 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] [2025-03-15 00:34:39,980 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:34:40,177 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:34:40,177 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:34:40,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:40,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1372092551, now seen corresponding path program 2 times [2025-03-15 00:34:40,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:40,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025903579] [2025-03-15 00:34:40,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:34:40,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:40,203 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:34:40,203 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:34:40,482 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:34:40,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:40,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025903579] [2025-03-15 00:34:40,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025903579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:40,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:40,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:34:40,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019292101] [2025-03-15 00:34:40,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:40,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:34:40,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:40,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:34:40,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:34:40,484 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 339 [2025-03-15 00:34:40,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 395 transitions, 1897 flow. Second operand has 6 states, 6 states have (on average 204.16666666666666) internal successors, (1225), 6 states have internal predecessors, (1225), 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:34:40,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:40,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 339 [2025-03-15 00:34:40,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:40,994 INFO L124 PetriNetUnfolderBase]: 860/2855 cut-off events. [2025-03-15 00:34:40,994 INFO L125 PetriNetUnfolderBase]: For 3493/3874 co-relation queries the response was YES. [2025-03-15 00:34:40,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9463 conditions, 2855 events. 860/2855 cut-off events. For 3493/3874 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 16605 event pairs, 858 based on Foata normal form. 0/2558 useless extension candidates. Maximal degree in co-relation 8451. Up to 1896 conditions per place. [2025-03-15 00:34:41,011 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 140 selfloop transitions, 9 changer transitions 1/393 dead transitions. [2025-03-15 00:34:41,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 393 transitions, 2179 flow [2025-03-15 00:34:41,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:34:41,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:34:41,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1328 transitions. [2025-03-15 00:34:41,015 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6529006882989183 [2025-03-15 00:34:41,016 INFO L298 CegarLoopForPetriNet]: 339 programPoint places, 70 predicate places. [2025-03-15 00:34:41,016 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 393 transitions, 2179 flow [2025-03-15 00:34:41,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 204.16666666666666) internal successors, (1225), 6 states have internal predecessors, (1225), 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:34:41,016 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:41,016 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] [2025-03-15 00:34:41,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:34:41,017 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:34:41,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:41,017 INFO L85 PathProgramCache]: Analyzing trace with hash -321829504, now seen corresponding path program 1 times [2025-03-15 00:34:41,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:41,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163688513] [2025-03-15 00:34:41,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:34:41,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:34:41,580 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:34:41,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:41,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163688513] [2025-03-15 00:34:41,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163688513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:41,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:41,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:34:41,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26505648] [2025-03-15 00:34:41,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:41,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:34:41,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:41,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:34:41,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:34:41,583 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 339 [2025-03-15 00:34:41,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 393 transitions, 2179 flow. Second operand has 6 states, 6 states have (on average 208.66666666666666) internal successors, (1252), 6 states have internal predecessors, (1252), 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:34:41,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:41,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 339 [2025-03-15 00:34:41,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:42,213 INFO L124 PetriNetUnfolderBase]: 860/2853 cut-off events. [2025-03-15 00:34:42,213 INFO L125 PetriNetUnfolderBase]: For 4303/4882 co-relation queries the response was YES. [2025-03-15 00:34:42,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11353 conditions, 2853 events. 860/2853 cut-off events. For 4303/4882 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 16612 event pairs, 858 based on Foata normal form. 0/2558 useless extension candidates. Maximal degree in co-relation 10228. Up to 1894 conditions per place. [2025-03-15 00:34:42,228 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 136 selfloop transitions, 9 changer transitions 1/391 dead transitions. [2025-03-15 00:34:42,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 391 transitions, 2449 flow [2025-03-15 00:34:42,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:34:42,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:34:42,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1337 transitions. [2025-03-15 00:34:42,233 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6573254670599803 [2025-03-15 00:34:42,233 INFO L298 CegarLoopForPetriNet]: 339 programPoint places, 74 predicate places. [2025-03-15 00:34:42,233 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 391 transitions, 2449 flow [2025-03-15 00:34:42,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 208.66666666666666) internal successors, (1252), 6 states have internal predecessors, (1252), 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:34:42,234 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:42,234 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] [2025-03-15 00:34:42,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:34:42,234 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:34:42,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:42,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1758263963, now seen corresponding path program 1 times [2025-03-15 00:34:42,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:42,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398790407] [2025-03-15 00:34:42,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:34:42,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:34:42,853 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:34:42,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:42,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398790407] [2025-03-15 00:34:42,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398790407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:42,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:42,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:34:42,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612121542] [2025-03-15 00:34:42,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:42,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:34:42,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:42,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:34:42,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:34:42,856 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 339 [2025-03-15 00:34:42,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 391 transitions, 2449 flow. Second operand has 6 states, 6 states have (on average 225.33333333333334) internal successors, (1352), 6 states have internal predecessors, (1352), 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:34:42,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:42,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 339 [2025-03-15 00:34:42,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:43,424 INFO L124 PetriNetUnfolderBase]: 860/2851 cut-off events. [2025-03-15 00:34:43,425 INFO L125 PetriNetUnfolderBase]: For 5317/6064 co-relation queries the response was YES. [2025-03-15 00:34:43,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13123 conditions, 2851 events. 860/2851 cut-off events. For 5317/6064 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 16592 event pairs, 858 based on Foata normal form. 0/2558 useless extension candidates. Maximal degree in co-relation 11902. Up to 1892 conditions per place. [2025-03-15 00:34:43,435 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 116 selfloop transitions, 5 changer transitions 1/390 dead transitions. [2025-03-15 00:34:43,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 390 transitions, 2681 flow [2025-03-15 00:34:43,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:34:43,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:34:43,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1426 transitions. [2025-03-15 00:34:43,438 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7010816125860374 [2025-03-15 00:34:43,438 INFO L298 CegarLoopForPetriNet]: 339 programPoint places, 78 predicate places. [2025-03-15 00:34:43,438 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 390 transitions, 2681 flow [2025-03-15 00:34:43,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.33333333333334) internal successors, (1352), 6 states have internal predecessors, (1352), 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:34:43,438 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:43,439 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] [2025-03-15 00:34:43,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:34:43,439 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:34:43,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:43,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1504377346, now seen corresponding path program 1 times [2025-03-15 00:34:43,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:43,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770955683] [2025-03-15 00:34:43,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:34:43,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:34:43,839 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:34:43,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:43,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770955683] [2025-03-15 00:34:43,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770955683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:43,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:43,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:34:43,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594581396] [2025-03-15 00:34:43,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:43,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:34:43,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:43,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:34:43,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:34:43,841 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 339 [2025-03-15 00:34:43,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 390 transitions, 2681 flow. Second operand has 6 states, 6 states have (on average 224.5) internal successors, (1347), 6 states have internal predecessors, (1347), 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:34:43,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:43,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 339 [2025-03-15 00:34:43,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:44,539 INFO L124 PetriNetUnfolderBase]: 860/2849 cut-off events. [2025-03-15 00:34:44,540 INFO L125 PetriNetUnfolderBase]: For 6546/7447 co-relation queries the response was YES. [2025-03-15 00:34:44,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14893 conditions, 2849 events. 860/2849 cut-off events. For 6546/7447 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 16535 event pairs, 858 based on Foata normal form. 0/2558 useless extension candidates. Maximal degree in co-relation 13576. Up to 1890 conditions per place. [2025-03-15 00:34:44,560 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 117 selfloop transitions, 5 changer transitions 1/389 dead transitions. [2025-03-15 00:34:44,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 389 transitions, 2913 flow [2025-03-15 00:34:44,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:34:44,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:34:44,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1415 transitions. [2025-03-15 00:34:44,563 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6956735496558505 [2025-03-15 00:34:44,563 INFO L298 CegarLoopForPetriNet]: 339 programPoint places, 82 predicate places. [2025-03-15 00:34:44,563 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 389 transitions, 2913 flow [2025-03-15 00:34:44,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.5) internal successors, (1347), 6 states have internal predecessors, (1347), 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:34:44,564 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:44,564 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] [2025-03-15 00:34:44,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:34:44,564 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:34:44,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:44,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1817396548, now seen corresponding path program 1 times [2025-03-15 00:34:44,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:44,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966294637] [2025-03-15 00:34:44,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:34:44,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:34:44,953 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:34:44,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:44,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966294637] [2025-03-15 00:34:44,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966294637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:44,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:44,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:34:44,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469440982] [2025-03-15 00:34:44,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:44,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:34:44,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:44,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:34:44,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:34:44,955 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 339 [2025-03-15 00:34:44,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 389 transitions, 2913 flow. Second operand has 6 states, 6 states have (on average 225.33333333333334) internal successors, (1352), 6 states have internal predecessors, (1352), 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:34:44,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:44,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 339 [2025-03-15 00:34:44,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:45,562 INFO L124 PetriNetUnfolderBase]: 860/2847 cut-off events. [2025-03-15 00:34:45,562 INFO L125 PetriNetUnfolderBase]: For 7996/9051 co-relation queries the response was YES. [2025-03-15 00:34:45,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16659 conditions, 2847 events. 860/2847 cut-off events. For 7996/9051 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 16529 event pairs, 858 based on Foata normal form. 0/2558 useless extension candidates. Maximal degree in co-relation 15250. Up to 1888 conditions per place. [2025-03-15 00:34:45,575 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 116 selfloop transitions, 5 changer transitions 1/388 dead transitions. [2025-03-15 00:34:45,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 388 transitions, 3141 flow [2025-03-15 00:34:45,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:34:45,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:34:45,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1414 transitions. [2025-03-15 00:34:45,577 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6951819075712881 [2025-03-15 00:34:45,578 INFO L298 CegarLoopForPetriNet]: 339 programPoint places, 86 predicate places. [2025-03-15 00:34:45,578 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 388 transitions, 3141 flow [2025-03-15 00:34:45,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.33333333333334) internal successors, (1352), 6 states have internal predecessors, (1352), 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:34:45,578 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:45,578 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, 1, 1] [2025-03-15 00:34:45,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:34:45,578 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:34:45,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:45,579 INFO L85 PathProgramCache]: Analyzing trace with hash -805205199, now seen corresponding path program 1 times [2025-03-15 00:34:45,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:45,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818882289] [2025-03-15 00:34:45,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:34:45,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:34:45,701 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:34:45,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:45,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818882289] [2025-03-15 00:34:45,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818882289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:34:45,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352017719] [2025-03-15 00:34:45,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:34:45,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:34:45,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:34:45,704 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:34:45,705 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:34:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:34:45,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 00:34:45,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:34:45,983 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:34:45,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:34:46,088 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:34:46,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352017719] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:34:46,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:34:46,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-15 00:34:46,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956098933] [2025-03-15 00:34:46,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:34:46,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 00:34:46,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:46,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 00:34:46,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-15 00:34:46,092 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 339 [2025-03-15 00:34:46,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 388 transitions, 3141 flow. Second operand has 10 states, 10 states have (on average 314.6) internal successors, (3146), 10 states have internal predecessors, (3146), 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:34:46,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:46,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 339 [2025-03-15 00:34:46,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:46,787 INFO L124 PetriNetUnfolderBase]: 860/2954 cut-off events. [2025-03-15 00:34:46,787 INFO L125 PetriNetUnfolderBase]: For 9818/10881 co-relation queries the response was YES. [2025-03-15 00:34:46,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17383 conditions, 2954 events. 860/2954 cut-off events. For 9818/10881 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 15620 event pairs, 858 based on Foata normal form. 0/2665 useless extension candidates. Maximal degree in co-relation 15416. Up to 1936 conditions per place. [2025-03-15 00:34:46,801 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 50 selfloop transitions, 9 changer transitions 1/406 dead transitions. [2025-03-15 00:34:46,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 406 transitions, 3491 flow [2025-03-15 00:34:46,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 00:34:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 00:34:46,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2842 transitions. [2025-03-15 00:34:46,803 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9314978695509669 [2025-03-15 00:34:46,803 INFO L298 CegarLoopForPetriNet]: 339 programPoint places, 94 predicate places. [2025-03-15 00:34:46,803 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 406 transitions, 3491 flow [2025-03-15 00:34:46,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 314.6) internal successors, (3146), 10 states have internal predecessors, (3146), 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:34:46,804 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:46,805 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] [2025-03-15 00:34:46,813 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:34:47,005 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:34:47,007 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:34:47,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:47,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1208235729, now seen corresponding path program 2 times [2025-03-15 00:34:47,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:47,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439366273] [2025-03-15 00:34:47,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:34:47,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:47,057 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:34:47,057 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:34:47,241 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:34:47,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:47,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439366273] [2025-03-15 00:34:47,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439366273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:47,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:47,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:34:47,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446074299] [2025-03-15 00:34:47,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:47,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:34:47,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:47,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:34:47,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:34:47,244 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 339 [2025-03-15 00:34:47,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 406 transitions, 3491 flow. Second operand has 6 states, 6 states have (on average 216.5) internal successors, (1299), 6 states have internal predecessors, (1299), 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:34:47,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:47,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 339 [2025-03-15 00:34:47,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:48,859 INFO L124 PetriNetUnfolderBase]: 1524/4711 cut-off events. [2025-03-15 00:34:48,859 INFO L125 PetriNetUnfolderBase]: For 18469/20239 co-relation queries the response was YES. [2025-03-15 00:34:48,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32120 conditions, 4711 events. 1524/4711 cut-off events. For 18469/20239 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 30807 event pairs, 115 based on Foata normal form. 0/4251 useless extension candidates. Maximal degree in co-relation 29996. Up to 3282 conditions per place. [2025-03-15 00:34:48,885 INFO L140 encePairwiseOnDemand]: 316/339 looper letters, 251 selfloop transitions, 70 changer transitions 1/580 dead transitions. [2025-03-15 00:34:48,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 580 transitions, 6987 flow [2025-03-15 00:34:48,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:34:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:34:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1528 transitions. [2025-03-15 00:34:48,887 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7512291052114061 [2025-03-15 00:34:48,887 INFO L298 CegarLoopForPetriNet]: 339 programPoint places, 99 predicate places. [2025-03-15 00:34:48,887 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 580 transitions, 6987 flow [2025-03-15 00:34:48,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.5) internal successors, (1299), 6 states have internal predecessors, (1299), 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:34:48,888 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:48,889 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, 1, 1] [2025-03-15 00:34:48,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 00:34:48,889 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:34:48,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:48,890 INFO L85 PathProgramCache]: Analyzing trace with hash -371345850, now seen corresponding path program 1 times [2025-03-15 00:34:48,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:48,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146465228] [2025-03-15 00:34:48,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:34:48,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:34:49,277 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:34:49,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:49,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146465228] [2025-03-15 00:34:49,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146465228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:34:49,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997245864] [2025-03-15 00:34:49,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:34:49,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:34:49,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:34:49,279 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:34:49,288 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:34:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:34:49,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 1624 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-15 00:34:49,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:34:49,923 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:34:49,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:34:50,255 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:34:50,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997245864] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:34:50,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:34:50,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-15 00:34:50,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357225298] [2025-03-15 00:34:50,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:34:50,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-15 00:34:50,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:50,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-15 00:34:50,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-15 00:34:50,261 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 339 [2025-03-15 00:34:50,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 580 transitions, 6987 flow. Second operand has 18 states, 18 states have (on average 315.6666666666667) internal successors, (5682), 18 states have internal predecessors, (5682), 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:34:50,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:50,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 339 [2025-03-15 00:34:50,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:52,148 INFO L124 PetriNetUnfolderBase]: 1524/5121 cut-off events. [2025-03-15 00:34:52,148 INFO L125 PetriNetUnfolderBase]: For 22448/24352 co-relation queries the response was YES. [2025-03-15 00:34:52,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34732 conditions, 5121 events. 1524/5121 cut-off events. For 22448/24352 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 30775 event pairs, 115 based on Foata normal form. 0/4661 useless extension candidates. Maximal degree in co-relation 30245. Up to 3470 conditions per place. [2025-03-15 00:34:52,170 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 112 selfloop transitions, 21 changer transitions 1/644 dead transitions. [2025-03-15 00:34:52,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 644 transitions, 8365 flow [2025-03-15 00:34:52,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-15 00:34:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-15 00:34:52,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6616 transitions. [2025-03-15 00:34:52,174 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9293440089900267 [2025-03-15 00:34:52,174 INFO L298 CegarLoopForPetriNet]: 339 programPoint places, 119 predicate places. [2025-03-15 00:34:52,174 INFO L471 AbstractCegarLoop]: Abstraction has has 458 places, 644 transitions, 8365 flow [2025-03-15 00:34:52,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 315.6666666666667) internal successors, (5682), 18 states have internal predecessors, (5682), 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:34:52,175 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:52,175 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] [2025-03-15 00:34:52,187 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:34:52,376 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:34:52,376 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:34:52,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:52,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1791796614, now seen corresponding path program 2 times [2025-03-15 00:34:52,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:52,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037955887] [2025-03-15 00:34:52,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:34:52,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:52,461 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:34:52,462 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:34:52,595 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:34:52,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:52,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037955887] [2025-03-15 00:34:52,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037955887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:34:52,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:34:52,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:34:52,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234816568] [2025-03-15 00:34:52,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:34:52,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:34:52,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:52,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:34:52,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:34:52,597 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 339 [2025-03-15 00:34:52,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 644 transitions, 8365 flow. Second operand has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 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:34:52,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:52,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 339 [2025-03-15 00:34:52,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:34:55,399 INFO L124 PetriNetUnfolderBase]: 1818/5737 cut-off events. [2025-03-15 00:34:55,399 INFO L125 PetriNetUnfolderBase]: For 29986/32753 co-relation queries the response was YES. [2025-03-15 00:34:55,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42639 conditions, 5737 events. 1818/5737 cut-off events. For 29986/32753 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 35388 event pairs, 204 based on Foata normal form. 0/5264 useless extension candidates. Maximal degree in co-relation 37834. Up to 3878 conditions per place. [2025-03-15 00:34:55,428 INFO L140 encePairwiseOnDemand]: 316/339 looper letters, 505 selfloop transitions, 134 changer transitions 1/944 dead transitions. [2025-03-15 00:34:55,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 944 transitions, 15195 flow [2025-03-15 00:34:55,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:34:55,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:34:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1581 transitions. [2025-03-15 00:34:55,430 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7772861356932154 [2025-03-15 00:34:55,430 INFO L298 CegarLoopForPetriNet]: 339 programPoint places, 124 predicate places. [2025-03-15 00:34:55,430 INFO L471 AbstractCegarLoop]: Abstraction has has 463 places, 944 transitions, 15195 flow [2025-03-15 00:34:55,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 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:34:55,430 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:34:55,431 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, 1, 1] [2025-03-15 00:34:55,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 00:34:55,431 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:34:55,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:34:55,432 INFO L85 PathProgramCache]: Analyzing trace with hash 501107566, now seen corresponding path program 1 times [2025-03-15 00:34:55,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:34:55,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296900469] [2025-03-15 00:34:55,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:34:55,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:34:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:34:56,674 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:34:56,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:34:56,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296900469] [2025-03-15 00:34:56,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296900469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:34:56,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414310949] [2025-03-15 00:34:56,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:34:56,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:34:56,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:34:56,677 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:34:56,678 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:34:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:34:57,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 3341 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-15 00:34:57,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:34:57,903 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:34:57,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:34:58,484 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:34:58,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414310949] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 00:34:58,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 00:34:58,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-15 00:34:58,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721899813] [2025-03-15 00:34:58,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 00:34:58,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-15 00:34:58,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:34:58,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-15 00:34:58,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-15 00:34:58,498 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 339 [2025-03-15 00:34:58,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 944 transitions, 15195 flow. Second operand has 23 states, 23 states have (on average 316.30434782608694) internal successors, (7275), 23 states have internal predecessors, (7275), 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:34:58,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:34:58,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 339 [2025-03-15 00:34:58,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:01,786 INFO L124 PetriNetUnfolderBase]: 1818/6042 cut-off events. [2025-03-15 00:35:01,786 INFO L125 PetriNetUnfolderBase]: For 35058/38063 co-relation queries the response was YES. [2025-03-15 00:35:01,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44930 conditions, 6042 events. 1818/6042 cut-off events. For 35058/38063 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 35256 event pairs, 194 based on Foata normal form. 0/5570 useless extension candidates. Maximal degree in co-relation 38092. Up to 4019 conditions per place. [2025-03-15 00:35:01,814 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 163 selfloop transitions, 30 changer transitions 1/992 dead transitions. [2025-03-15 00:35:01,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 992 transitions, 16571 flow [2025-03-15 00:35:01,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-15 00:35:01,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-15 00:35:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9444 transitions. [2025-03-15 00:35:01,820 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9286135693215339 [2025-03-15 00:35:01,821 INFO L298 CegarLoopForPetriNet]: 339 programPoint places, 153 predicate places. [2025-03-15 00:35:01,821 INFO L471 AbstractCegarLoop]: Abstraction has has 492 places, 992 transitions, 16571 flow [2025-03-15 00:35:01,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 316.30434782608694) internal successors, (7275), 23 states have internal predecessors, (7275), 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:35:01,822 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:01,823 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] [2025-03-15 00:35:01,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-15 00:35:02,023 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:35:02,024 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:35:02,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:02,026 INFO L85 PathProgramCache]: Analyzing trace with hash 254029667, now seen corresponding path program 2 times [2025-03-15 00:35:02,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:02,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534212678] [2025-03-15 00:35:02,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:35:02,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:02,173 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:35:02,173 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:35:02,462 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:35:02,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:02,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534212678] [2025-03-15 00:35:02,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534212678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:35:02,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:35:02,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:35:02,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587491036] [2025-03-15 00:35:02,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:35:02,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:35:02,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:02,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:35:02,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:35:02,464 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 339 [2025-03-15 00:35:02,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 992 transitions, 16571 flow. Second operand has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 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:35:02,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:02,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 339 [2025-03-15 00:35:02,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:06,913 INFO L124 PetriNetUnfolderBase]: 2185/6916 cut-off events. [2025-03-15 00:35:06,913 INFO L125 PetriNetUnfolderBase]: For 55817/60883 co-relation queries the response was YES. [2025-03-15 00:35:06,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55921 conditions, 6916 events. 2185/6916 cut-off events. For 55817/60883 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 42436 event pairs, 311 based on Foata normal form. 0/6405 useless extension candidates. Maximal degree in co-relation 48629. Up to 4576 conditions per place. [2025-03-15 00:35:06,960 INFO L140 encePairwiseOnDemand]: 316/339 looper letters, 794 selfloop transitions, 135 changer transitions 42/1293 dead transitions. [2025-03-15 00:35:06,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 1293 transitions, 24743 flow [2025-03-15 00:35:06,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:35:06,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:35:06,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1582 transitions. [2025-03-15 00:35:06,962 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2025-03-15 00:35:06,962 INFO L298 CegarLoopForPetriNet]: 339 programPoint places, 158 predicate places. [2025-03-15 00:35:06,962 INFO L471 AbstractCegarLoop]: Abstraction has has 497 places, 1293 transitions, 24743 flow [2025-03-15 00:35:06,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 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:35:06,963 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:06,963 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] [2025-03-15 00:35:06,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 00:35:06,963 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:35:06,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:06,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1303311258, now seen corresponding path program 1 times [2025-03-15 00:35:06,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:06,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919297074] [2025-03-15 00:35:06,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:35:06,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:35:10,011 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:35:10,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:10,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919297074] [2025-03-15 00:35:10,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919297074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:35:10,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:35:10,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:35:10,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570991131] [2025-03-15 00:35:10,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:35:10,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:35:10,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:35:10,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:35:10,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:35:10,014 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 339 [2025-03-15 00:35:10,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 1293 transitions, 24743 flow. Second operand has 6 states, 6 states have (on average 225.33333333333334) internal successors, (1352), 6 states have internal predecessors, (1352), 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:35:10,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:35:10,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 339 [2025-03-15 00:35:10,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:35:14,831 INFO L124 PetriNetUnfolderBase]: 2585/7837 cut-off events. [2025-03-15 00:35:14,831 INFO L125 PetriNetUnfolderBase]: For 79037/84039 co-relation queries the response was YES. [2025-03-15 00:35:14,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67172 conditions, 7837 events. 2585/7837 cut-off events. For 79037/84039 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 49811 event pairs, 353 based on Foata normal form. 7/7306 useless extension candidates. Maximal degree in co-relation 59428. Up to 5060 conditions per place. [2025-03-15 00:35:14,881 INFO L140 encePairwiseOnDemand]: 320/339 looper letters, 942 selfloop transitions, 115 changer transitions 42/1420 dead transitions. [2025-03-15 00:35:14,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 1420 transitions, 29919 flow [2025-03-15 00:35:14,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:35:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:35:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1494 transitions. [2025-03-15 00:35:14,883 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7345132743362832 [2025-03-15 00:35:14,883 INFO L298 CegarLoopForPetriNet]: 339 programPoint places, 163 predicate places. [2025-03-15 00:35:14,883 INFO L471 AbstractCegarLoop]: Abstraction has has 502 places, 1420 transitions, 29919 flow [2025-03-15 00:35:14,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.33333333333334) internal successors, (1352), 6 states have internal predecessors, (1352), 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:35:14,883 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:35:14,884 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, 1, 1] [2025-03-15 00:35:14,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 00:35:14,884 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:35:14,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:35:14,886 INFO L85 PathProgramCache]: Analyzing trace with hash 770223477, now seen corresponding path program 1 times [2025-03-15 00:35:14,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:35:14,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20872649] [2025-03-15 00:35:14,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:35:14,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:35:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:35:46,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 152 proven. 2209 refuted. 0 times theorem prover too weak. 2609 trivial. 0 not checked. [2025-03-15 00:35:46,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:35:46,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20872649] [2025-03-15 00:35:46,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20872649] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:35:46,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486191119] [2025-03-15 00:35:46,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:35:46,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:35:46,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:35:46,621 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:35:46,622 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:35:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:35:48,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 4610 conjuncts, 116 conjuncts are in the unsatisfiable core [2025-03-15 00:35:48,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:35:48,614 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 00:35:48,615 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:35:48,857 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 00:35:48,857 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:35:49,513 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 00:35:49,513 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:35:49,705 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 00:35:49,706 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:35:50,094 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-15 00:35:50,094 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:35:50,603 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-15 00:35:50,603 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:35:51,795 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-15 00:35:51,796 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 29 treesize of output 40 [2025-03-15 00:35:52,440 INFO L349 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2025-03-15 00:35:52,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2025-03-15 00:35:53,654 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-15 00:35:53,654 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 29 treesize of output 40 [2025-03-15 00:35:54,245 INFO L349 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2025-03-15 00:35:54,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2025-03-15 00:35:55,401 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-15 00:35:55,402 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 29 treesize of output 40 [2025-03-15 00:35:56,015 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-15 00:35:56,015 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 29 treesize of output 40 [2025-03-15 00:35:56,969 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-15 00:35:56,970 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 29 treesize of output 40 [2025-03-15 00:35:57,564 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-15 00:35:57,564 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 29 treesize of output 40 [2025-03-15 00:35:58,583 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-15 00:35:58,584 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 29 treesize of output 40 [2025-03-15 00:35:59,114 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-15 00:35:59,115 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:36:00,674 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-15 00:36:00,674 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:36:01,552 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-15 00:36:01,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-03-15 00:36:03,104 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-15 00:36:03,105 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:36:03,911 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-15 00:36:03,912 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:36:05,830 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:36:05,912 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 25 treesize of output 24 [2025-03-15 00:36:06,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2025-03-15 00:36:06,323 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2025-03-15 00:36:06,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2025-03-15 00:36:06,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2025-03-15 00:36:06,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2025-03-15 00:36:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 3008 proven. 374 refuted. 0 times theorem prover too weak. 1588 trivial. 0 not checked. [2025-03-15 00:36:06,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 00:36:17,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 3335 proven. 0 refuted. 0 times theorem prover too weak. 1635 trivial. 0 not checked. [2025-03-15 00:36:17,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486191119] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-15 00:36:17,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-15 00:36:17,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [27, 24] total 63 [2025-03-15 00:36:17,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982406098] [2025-03-15 00:36:17,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:36:17,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-15 00:36:17,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:36:17,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-15 00:36:17,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=661, Invalid=3371, Unknown=0, NotChecked=0, Total=4032 [2025-03-15 00:36:17,700 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 339 [2025-03-15 00:36:17,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 1420 transitions, 29919 flow. Second operand has 17 states, 17 states have (on average 197.94117647058823) internal successors, (3365), 17 states have internal predecessors, (3365), 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:36:17,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:36:17,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 339 [2025-03-15 00:36:17,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:36:28,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:36:33,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:36:35,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:36:37,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:36:41,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:36:42,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:36:47,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:36:55,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:37:03,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:37:06,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:37:10,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:37:12,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:37:15,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:37:17,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:37:19,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:37:24,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:37:27,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:37:33,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:37:36,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:37:38,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:37:40,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:37:42,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:37:46,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:37:49,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:37:51,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:37:54,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:37:56,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:37:58,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:38:01,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:38:04,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:38:07,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:38:09,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:38:12,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:38:14,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:38:16,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:38:18,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:38:21,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:38:24,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:38:26,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:38:29,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:38:32,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:38:35,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:38:40,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:38:46,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:38:51,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:38:53,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:38:55,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 00:38:59,869 INFO L124 PetriNetUnfolderBase]: 2863/8490 cut-off events. [2025-03-15 00:38:59,869 INFO L125 PetriNetUnfolderBase]: For 100891/107571 co-relation queries the response was YES. [2025-03-15 00:38:59,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78459 conditions, 8490 events. 2863/8490 cut-off events. For 100891/107571 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 55409 event pairs, 275 based on Foata normal form. 103/8049 useless extension candidates. Maximal degree in co-relation 70200. Up to 5482 conditions per place. [2025-03-15 00:38:59,929 INFO L140 encePairwiseOnDemand]: 297/339 looper letters, 1162 selfloop transitions, 319 changer transitions 46/1796 dead transitions. [2025-03-15 00:38:59,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 1796 transitions, 41133 flow [2025-03-15 00:38:59,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-15 00:38:59,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-15 00:38:59,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4227 transitions. [2025-03-15 00:38:59,932 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6234513274336283 [2025-03-15 00:38:59,933 INFO L298 CegarLoopForPetriNet]: 339 programPoint places, 182 predicate places. [2025-03-15 00:38:59,933 INFO L471 AbstractCegarLoop]: Abstraction has has 521 places, 1796 transitions, 41133 flow [2025-03-15 00:38:59,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 197.94117647058823) internal successors, (3365), 17 states have internal predecessors, (3365), 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:59,933 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:38:59,934 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, 1, 1] [2025-03-15 00:38:59,952 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:39:00,134 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:39:00,134 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:39:00,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:39:00,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1961988345, now seen corresponding path program 2 times [2025-03-15 00:39:00,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:39:00,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576798243] [2025-03-15 00:39:00,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:39:00,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:39:02,378 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 00:39:02,379 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:39:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 36 proven. 2905 refuted. 0 times theorem prover too weak. 2029 trivial. 0 not checked. [2025-03-15 00:39:15,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:39:15,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576798243] [2025-03-15 00:39:15,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576798243] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:39:15,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416283833] [2025-03-15 00:39:15,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:39:15,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:39:15,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:39:15,294 INFO L229 MonitoredProcess]: Starting monitored process 9 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:39:15,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-15 00:39:16,589 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 00:39:16,589 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:39:16,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 4610 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-03-15 00:39:16,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 00:39:17,068 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 00:39:17,068 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:39:17,278 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-15 00:39:17,278 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:39:18,048 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:39:18,049 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 24 treesize of output 28 [2025-03-15 00:39:18,475 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:39:18,476 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 24 treesize of output 28 [2025-03-15 00:39:19,231 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:39:19,232 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 24 treesize of output 28 [2025-03-15 00:39:19,747 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:39:19,747 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 24 treesize of output 28 [2025-03-15 00:39:20,557 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:39:20,557 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 24 treesize of output 28 [2025-03-15 00:39:20,911 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:39:20,912 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 24 treesize of output 28 [2025-03-15 00:39:21,568 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:39:21,569 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 24 treesize of output 28 [2025-03-15 00:39:22,023 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:39:22,023 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 24 treesize of output 28 [2025-03-15 00:39:22,836 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:39:22,836 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 24 treesize of output 28 [2025-03-15 00:39:23,334 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:39:23,335 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 24 treesize of output 28 [2025-03-15 00:39:24,015 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:39:24,015 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 24 treesize of output 28 [2025-03-15 00:39:24,358 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:39:24,359 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 24 treesize of output 28 [2025-03-15 00:39:25,068 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:39:25,069 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 24 treesize of output 28 [2025-03-15 00:39:25,482 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:39:25,482 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 24 treesize of output 28 [2025-03-15 00:39:26,313 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:39:26,314 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 24 treesize of output 28 [2025-03-15 00:39:26,747 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:39:26,747 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 24 treesize of output 28 [2025-03-15 00:39:27,429 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:39:27,429 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 24 treesize of output 28 [2025-03-15 00:39:27,820 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 00:39:27,820 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 24 treesize of output 28 [2025-03-15 00:39:28,637 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 15 treesize of output 11 [2025-03-15 00:39:28,806 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 28 treesize of output 27 [2025-03-15 00:39:28,931 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-15 00:39:28,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-15 00:39:29,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:39:29,014 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 40 treesize of output 42 [2025-03-15 00:39:29,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 00:39:29,055 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 52 treesize of output 57 [2025-03-15 00:39:29,117 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 56 treesize of output 45 [2025-03-15 00:39:29,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 379 proven. 0 refuted. 0 times theorem prover too weak. 4591 trivial. 0 not checked. [2025-03-15 00:39:29,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 00:39:29,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416283833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:39:29,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 00:39:29,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26 [2025-03-15 00:39:29,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710652116] [2025-03-15 00:39:29,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:39:29,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 00:39:29,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:39:29,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 00:39:29,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2025-03-15 00:39:29,162 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 339 [2025-03-15 00:39:29,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 1796 transitions, 41133 flow. Second operand has 15 states, 15 states have (on average 192.93333333333334) internal successors, (2894), 15 states have internal predecessors, (2894), 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:39:29,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:39:29,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 339 [2025-03-15 00:39:29,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:39:41,345 INFO L124 PetriNetUnfolderBase]: 4317/12149 cut-off events. [2025-03-15 00:39:41,345 INFO L125 PetriNetUnfolderBase]: For 155513/161911 co-relation queries the response was YES. [2025-03-15 00:39:41,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120839 conditions, 12149 events. 4317/12149 cut-off events. For 155513/161911 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 90491 event pairs, 422 based on Foata normal form. 172/11493 useless extension candidates. Maximal degree in co-relation 112065. Up to 7897 conditions per place. [2025-03-15 00:39:41,459 INFO L140 encePairwiseOnDemand]: 304/339 looper letters, 1788 selfloop transitions, 324 changer transitions 46/2427 dead transitions. [2025-03-15 00:39:41,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 2427 transitions, 61533 flow [2025-03-15 00:39:41,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-15 00:39:41,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-15 00:39:41,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4364 transitions. [2025-03-15 00:39:41,463 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6130074448658519 [2025-03-15 00:39:41,464 INFO L298 CegarLoopForPetriNet]: 339 programPoint places, 202 predicate places. [2025-03-15 00:39:41,464 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 2427 transitions, 61533 flow [2025-03-15 00:39:41,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 192.93333333333334) internal successors, (2894), 15 states have internal predecessors, (2894), 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:39:41,464 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:39:41,465 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, 1, 1] [2025-03-15 00:39:41,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-15 00:39:41,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-15 00:39:41,665 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-15 00:39:41,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:39:41,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1537824909, now seen corresponding path program 3 times [2025-03-15 00:39:41,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:39:41,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684230947] [2025-03-15 00:39:41,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:39:41,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:39:46,178 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-15 00:39:46,179 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:40:43,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 898 proven. 1560 refuted. 0 times theorem prover too weak. 2512 trivial. 0 not checked. [2025-03-15 00:40:43,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:40:43,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684230947] [2025-03-15 00:40:43,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684230947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 00:40:43,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489991599] [2025-03-15 00:40:43,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:40:43,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 00:40:43,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:40:43,575 INFO L229 MonitoredProcess]: Starting monitored process 10 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:40:43,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process Received shutdown request... [2025-03-15 00:48:35,323 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 00:48:35,324 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:48:36,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2025-03-15 00:48:36,529 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forcibly destroying the process [2025-03-15 00:48:36,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 137 [2025-03-15 00:48:36,571 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-15 00:48:36,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-15 00:48:36,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2025-03-15 00:48:36,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749175914] [2025-03-15 00:48:36,572 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-15 00:48:36,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-15 00:48:36,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:48:36,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-15 00:48:36,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=990, Unknown=0, NotChecked=0, Total=1122 [2025-03-15 00:48:36,575 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 339 [2025-03-15 00:48:36,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 2427 transitions, 61533 flow. Second operand has 34 states, 34 states have (on average 161.2058823529412) internal successors, (5481), 34 states have internal predecessors, (5481), 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:48:36,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:48:36,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 339 [2025-03-15 00:48:36,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:48:36,581 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (24 of 25 remaining) [2025-03-15 00:48:36,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 00:48:36,582 WARN L596 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-03-15 00:48:36,583 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2025-03-15 00:48:36,583 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2025-03-15 00:48:36,583 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2025-03-15 00:48:36,583 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2025-03-15 00:48:36,583 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2025-03-15 00:48:36,583 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2025-03-15 00:48:36,583 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2025-03-15 00:48:36,583 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2025-03-15 00:48:36,583 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2025-03-15 00:48:36,583 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2025-03-15 00:48:36,584 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2025-03-15 00:48:36,584 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 25 remaining) [2025-03-15 00:48:36,584 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2025-03-15 00:48:36,584 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2025-03-15 00:48:36,584 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2025-03-15 00:48:36,584 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2025-03-15 00:48:36,584 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2025-03-15 00:48:36,584 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2025-03-15 00:48:36,584 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2025-03-15 00:48:36,584 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2025-03-15 00:48:36,584 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2025-03-15 00:48:36,584 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2025-03-15 00:48:36,584 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2025-03-15 00:48:36,584 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2025-03-15 00:48:36,584 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:48:36,588 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:48:36,588 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:48:36,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:48:36 BasicIcfg [2025-03-15 00:48:36,591 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:48:36,592 INFO L158 Benchmark]: Toolchain (without parser) took 845214.49ms. Allocated memory was 71.3MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 42.1MB in the beginning and 340.0MB in the end (delta: -298.0MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-03-15 00:48:36,592 INFO L158 Benchmark]: CDTParser took 1.37ms. Allocated memory is still 71.3MB. Free memory was 31.8MB in the beginning and 31.8MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:48:36,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 702.07ms. Allocated memory is still 71.3MB. Free memory was 41.9MB in the beginning and 23.5MB in the end (delta: 18.5MB). Peak memory consumption was 27.4MB. Max. memory is 8.0GB. [2025-03-15 00:48:36,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.71ms. Allocated memory is still 71.3MB. Free memory was 23.5MB in the beginning and 39.3MB in the end (delta: -15.8MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. [2025-03-15 00:48:36,592 INFO L158 Benchmark]: Boogie Preprocessor took 42.32ms. Allocated memory is still 71.3MB. Free memory was 39.3MB in the beginning and 35.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:48:36,592 INFO L158 Benchmark]: RCFGBuilder took 667.63ms. Allocated memory was 71.3MB in the beginning and 100.7MB in the end (delta: 29.4MB). Free memory was 35.7MB in the beginning and 50.6MB in the end (delta: -15.0MB). Peak memory consumption was 24.0MB. Max. memory is 8.0GB. [2025-03-15 00:48:36,593 INFO L158 Benchmark]: TraceAbstraction took 843725.73ms. Allocated memory was 100.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 49.7MB in the beginning and 340.0MB in the end (delta: -290.3MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-03-15 00:48:36,596 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.37ms. Allocated memory is still 71.3MB. Free memory was 31.8MB in the beginning and 31.8MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 702.07ms. Allocated memory is still 71.3MB. Free memory was 41.9MB in the beginning and 23.5MB in the end (delta: 18.5MB). Peak memory consumption was 27.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.71ms. Allocated memory is still 71.3MB. Free memory was 23.5MB in the beginning and 39.3MB in the end (delta: -15.8MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.32ms. Allocated memory is still 71.3MB. Free memory was 39.3MB in the beginning and 35.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 667.63ms. Allocated memory was 71.3MB in the beginning and 100.7MB in the end (delta: 29.4MB). Free memory was 35.7MB in the beginning and 50.6MB in the end (delta: -15.0MB). Peak memory consumption was 24.0MB. Max. memory is 8.0GB. * TraceAbstraction took 843725.73ms. Allocated memory was 100.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 49.7MB in the beginning and 340.0MB in the end (delta: -290.3MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1266]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1266]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1267]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1261]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1262]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1264]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1234]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1235]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1249]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1239]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1240]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1241]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 427 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: 843.6s, OverallIterations: 22, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 201.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 42 mSolverCounterUnknown, 1483 SdHoareTripleChecker+Valid, 155.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1483 mSDsluCounter, 2160 SdHoareTripleChecker+Invalid, 152.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 691 mSDsCounter, 402 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9640 IncrementalHoareTripleChecker+Invalid, 10085 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 402 mSolverCounterUnsat, 1469 mSDtfsCounter, 9640 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8197 GetRequests, 7772 SyntacticMatches, 73 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6648 ImplicationChecksByTransitivity, 14.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61533occurred in iteration=21, InterpolantAutomatonStates: 233, 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.8s SsaConstructionTime, 11.9s SatisfiabilityAnalysisTime, 152.3s InterpolantComputationTime, 15429 NumberOfCodeBlocks, 13079 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 18622 ConstructedInterpolants, 2776 QuantifiedInterpolants, 177701 SizeOfPredicates, 107 NumberOfNonLiveVariables, 15890 ConjunctsInSsa, 261 ConjunctsInUnsatCore, 37 InterpolantComputations, 15 PerfectInterpolantSequences, 39150/54184 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