/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.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows ASSERTandASSUME -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 02:41:06,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 02:41:06,359 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 02:41:06,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 02:41:06,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 02:41:06,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 02:41:06,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 02:41:06,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 02:41:06,378 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 02:41:06,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 02:41:06,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 02:41:06,378 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 02:41:06,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 02:41:06,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 02:41:06,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 02:41:06,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 02:41:06,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 02:41:06,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 02:41:06,378 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 02:41:06,378 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 02:41:06,379 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 02:41:06,379 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 02:41:06,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 02:41:06,379 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 02:41:06,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 02:41:06,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:41:06,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 02:41:06,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 02:41:06,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 02:41:06,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 02:41:06,379 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 02:41:06,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 02:41:06,379 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 unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> ASSERTandASSUME [2025-03-15 02:41:06,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 02:41:06,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 02:41:06,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 02:41:06,645 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 02:41:06,645 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 02:41:06,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2025-03-15 02:41:07,798 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79388cf4a/3399aa006db74de5bafc86a64eb3919f/FLAG0c4424739 [2025-03-15 02:41:07,977 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 02:41:07,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2025-03-15 02:41:07,985 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79388cf4a/3399aa006db74de5bafc86a64eb3919f/FLAG0c4424739 [2025-03-15 02:41:08,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79388cf4a/3399aa006db74de5bafc86a64eb3919f [2025-03-15 02:41:08,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 02:41:08,363 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 02:41:08,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 02:41:08,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 02:41:08,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 02:41:08,367 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:41:08" (1/1) ... [2025-03-15 02:41:08,367 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33b5c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:41:08, skipping insertion in model container [2025-03-15 02:41:08,367 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:41:08" (1/1) ... [2025-03-15 02:41:08,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 02:41:08,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:41:08,494 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 02:41:08,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:41:08,516 INFO L204 MainTranslator]: Completed translation [2025-03-15 02:41:08,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:41:08 WrapperNode [2025-03-15 02:41:08,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 02:41:08,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 02:41:08,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 02:41:08,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 02:41:08,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:41:08" (1/1) ... [2025-03-15 02:41:08,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:41:08" (1/1) ... [2025-03-15 02:41:08,542 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 161 [2025-03-15 02:41:08,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 02:41:08,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 02:41:08,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 02:41:08,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 02:41:08,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:41:08" (1/1) ... [2025-03-15 02:41:08,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:41:08" (1/1) ... [2025-03-15 02:41:08,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:41:08" (1/1) ... [2025-03-15 02:41:08,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:41:08" (1/1) ... [2025-03-15 02:41:08,565 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:41:08" (1/1) ... [2025-03-15 02:41:08,565 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:41:08" (1/1) ... [2025-03-15 02:41:08,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:41:08" (1/1) ... [2025-03-15 02:41:08,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:41:08" (1/1) ... [2025-03-15 02:41:08,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:41:08" (1/1) ... [2025-03-15 02:41:08,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 02:41:08,575 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 02:41:08,575 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 02:41:08,575 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 02:41:08,577 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:41:08" (1/1) ... [2025-03-15 02:41:08,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:41:08,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:41:08,600 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 02:41:08,605 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 02:41:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 02:41:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 02:41:08,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 02:41:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 02:41:08,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 02:41:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 02:41:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 02:41:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 02:41:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 02:41:08,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 02:41:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 02:41:08,619 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 02:41:08,695 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 02:41:08,696 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 02:41:08,942 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 02:41:08,942 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 02:41:08,952 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 02:41:08,952 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 02:41:08,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:41:08 BoogieIcfgContainer [2025-03-15 02:41:08,953 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 02:41:08,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 02:41:08,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 02:41:08,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 02:41:08,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 02:41:08" (1/3) ... [2025-03-15 02:41:08,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e4d3d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:41:08, skipping insertion in model container [2025-03-15 02:41:08,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:41:08" (2/3) ... [2025-03-15 02:41:08,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e4d3d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:41:08, skipping insertion in model container [2025-03-15 02:41:08,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:41:08" (3/3) ... [2025-03-15 02:41:08,960 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2025-03-15 02:41:08,971 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 02:41:08,973 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-counter-queue.wvr.c that has 3 procedures, 216 locations, 1 initial locations, 3 loop locations, and 18 error locations. [2025-03-15 02:41:08,973 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 02:41:09,049 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 02:41:09,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 02:41:09,090 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;@7a71584b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 02:41:09,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-03-15 02:41:09,114 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 02:41:09,115 INFO L124 PetriNetUnfolderBase]: 2/53 cut-off events. [2025-03-15 02:41:09,116 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 02:41:09,116 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:09,117 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] [2025-03-15 02:41:09,117 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:09,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:09,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1010927863, now seen corresponding path program 1 times [2025-03-15 02:41:09,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:09,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715983604] [2025-03-15 02:41:09,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:09,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:09,403 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 02:41:09,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:09,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715983604] [2025-03-15 02:41:09,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715983604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:41:09,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:41:09,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:41:09,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882586572] [2025-03-15 02:41:09,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:41:09,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:41:09,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:09,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:41:09,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:41:09,433 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 229 [2025-03-15 02:41:09,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 229 transitions, 472 flow. Second operand has 4 states, 4 states have (on average 204.5) internal successors, (818), 4 states have internal predecessors, (818), 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 02:41:09,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:09,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 229 [2025-03-15 02:41:09,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:09,543 INFO L124 PetriNetUnfolderBase]: 8/225 cut-off events. [2025-03-15 02:41:09,543 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-15 02:41:09,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 225 events. 8/225 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 449 event pairs, 0 based on Foata normal form. 8/200 useless extension candidates. Maximal degree in co-relation 172. Up to 20 conditions per place. [2025-03-15 02:41:09,558 INFO L140 encePairwiseOnDemand]: 214/229 looper letters, 21 selfloop transitions, 5 changer transitions 11/222 dead transitions. [2025-03-15 02:41:09,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 222 transitions, 510 flow [2025-03-15 02:41:09,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:41:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:41:09,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1052 transitions. [2025-03-15 02:41:09,574 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9187772925764193 [2025-03-15 02:41:09,577 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, -5 predicate places. [2025-03-15 02:41:09,577 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 222 transitions, 510 flow [2025-03-15 02:41:09,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 204.5) internal successors, (818), 4 states have internal predecessors, (818), 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 02:41:09,578 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:09,578 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:09,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 02:41:09,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:09,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:09,579 INFO L85 PathProgramCache]: Analyzing trace with hash 801655751, now seen corresponding path program 1 times [2025-03-15 02:41:09,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:09,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147427289] [2025-03-15 02:41:09,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:09,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:41:09,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:09,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147427289] [2025-03-15 02:41:09,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147427289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:41:09,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220869407] [2025-03-15 02:41:09,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:09,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:41:09,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:41:09,751 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 02:41:09,753 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 02:41:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:09,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:41:09,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:41:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:41:09,894 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:41:09,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220869407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:41:09,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:41:09,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 02:41:09,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717565823] [2025-03-15 02:41:09,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:41:09,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:41:09,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:09,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:41:09,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:41:09,900 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 229 [2025-03-15 02:41:09,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 222 transitions, 510 flow. Second operand has 6 states, 6 states have (on average 205.16666666666666) internal successors, (1231), 6 states have internal predecessors, (1231), 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 02:41:09,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:09,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 229 [2025-03-15 02:41:09,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:10,036 INFO L124 PetriNetUnfolderBase]: 8/224 cut-off events. [2025-03-15 02:41:10,037 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-15 02:41:10,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 224 events. 8/224 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 447 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 193. Up to 19 conditions per place. [2025-03-15 02:41:10,040 INFO L140 encePairwiseOnDemand]: 223/229 looper letters, 17 selfloop transitions, 8 changer transitions 11/221 dead transitions. [2025-03-15 02:41:10,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 221 transitions, 558 flow [2025-03-15 02:41:10,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:41:10,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:41:10,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1448 transitions. [2025-03-15 02:41:10,044 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9033063006862133 [2025-03-15 02:41:10,045 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 0 predicate places. [2025-03-15 02:41:10,045 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 221 transitions, 558 flow [2025-03-15 02:41:10,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.16666666666666) internal successors, (1231), 6 states have internal predecessors, (1231), 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 02:41:10,049 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:10,049 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:10,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-15 02:41:10,249 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 02:41:10,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:10,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:10,251 INFO L85 PathProgramCache]: Analyzing trace with hash -918474952, now seen corresponding path program 1 times [2025-03-15 02:41:10,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:10,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81404448] [2025-03-15 02:41:10,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:10,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:41:10,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:10,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81404448] [2025-03-15 02:41:10,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81404448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:41:10,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133536912] [2025-03-15 02:41:10,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:10,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:41:10,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:41:10,369 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 02:41:10,371 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 02:41:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:10,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:41:10,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:41:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:41:10,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:41:10,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:41:10,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133536912] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:41:10,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:41:10,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-15 02:41:10,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777706949] [2025-03-15 02:41:10,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:41:10,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 02:41:10,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:10,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 02:41:10,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-15 02:41:10,540 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 229 [2025-03-15 02:41:10,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 221 transitions, 558 flow. Second operand has 12 states, 12 states have (on average 205.83333333333334) internal successors, (2470), 12 states have internal predecessors, (2470), 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 02:41:10,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:10,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 229 [2025-03-15 02:41:10,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:10,722 INFO L124 PetriNetUnfolderBase]: 11/259 cut-off events. [2025-03-15 02:41:10,723 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-03-15 02:41:10,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 427 conditions, 259 events. 11/259 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 632 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 329. Up to 45 conditions per place. [2025-03-15 02:41:10,727 INFO L140 encePairwiseOnDemand]: 222/229 looper letters, 33 selfloop transitions, 18 changer transitions 11/247 dead transitions. [2025-03-15 02:41:10,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 247 transitions, 818 flow [2025-03-15 02:41:10,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 02:41:10,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 02:41:10,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2897 transitions. [2025-03-15 02:41:10,734 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9036182158452901 [2025-03-15 02:41:10,735 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 13 predicate places. [2025-03-15 02:41:10,735 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 247 transitions, 818 flow [2025-03-15 02:41:10,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 205.83333333333334) internal successors, (2470), 12 states have internal predecessors, (2470), 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 02:41:10,736 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:10,736 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] [2025-03-15 02:41:10,744 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 02:41:10,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-15 02:41:10,937 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:10,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:10,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1709408538, now seen corresponding path program 1 times [2025-03-15 02:41:10,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:10,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601298851] [2025-03-15 02:41:10,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:10,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:10,997 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 02:41:10,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:10,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601298851] [2025-03-15 02:41:10,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601298851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:41:10,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:41:10,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:41:10,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971112089] [2025-03-15 02:41:10,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:41:10,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:41:10,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:10,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:41:10,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:41:10,999 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 229 [2025-03-15 02:41:11,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 247 transitions, 818 flow. Second operand has 4 states, 4 states have (on average 194.5) internal successors, (778), 4 states have internal predecessors, (778), 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 02:41:11,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:11,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 229 [2025-03-15 02:41:11,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:11,121 INFO L124 PetriNetUnfolderBase]: 54/545 cut-off events. [2025-03-15 02:41:11,121 INFO L125 PetriNetUnfolderBase]: For 400/400 co-relation queries the response was YES. [2025-03-15 02:41:11,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 545 events. 54/545 cut-off events. For 400/400 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2771 event pairs, 13 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 686. Up to 77 conditions per place. [2025-03-15 02:41:11,126 INFO L140 encePairwiseOnDemand]: 221/229 looper letters, 34 selfloop transitions, 5 changer transitions 11/259 dead transitions. [2025-03-15 02:41:11,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 259 transitions, 940 flow [2025-03-15 02:41:11,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:41:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:41:11,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 815 transitions. [2025-03-15 02:41:11,128 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8897379912663755 [2025-03-15 02:41:11,129 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 15 predicate places. [2025-03-15 02:41:11,129 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 259 transitions, 940 flow [2025-03-15 02:41:11,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.5) internal successors, (778), 4 states have internal predecessors, (778), 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 02:41:11,130 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:11,130 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:41:11,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 02:41:11,130 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:11,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:11,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1452056559, now seen corresponding path program 1 times [2025-03-15 02:41:11,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:11,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955191895] [2025-03-15 02:41:11,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:11,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:11,261 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 02:41:11,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:11,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955191895] [2025-03-15 02:41:11,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955191895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:41:11,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:41:11,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:41:11,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724335700] [2025-03-15 02:41:11,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:41:11,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:41:11,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:11,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:41:11,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:41:11,263 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 229 [2025-03-15 02:41:11,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 259 transitions, 940 flow. Second operand has 7 states, 7 states have (on average 193.42857142857142) internal successors, (1354), 7 states have internal predecessors, (1354), 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 02:41:11,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:11,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 229 [2025-03-15 02:41:11,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:11,502 INFO L124 PetriNetUnfolderBase]: 102/936 cut-off events. [2025-03-15 02:41:11,502 INFO L125 PetriNetUnfolderBase]: For 907/907 co-relation queries the response was YES. [2025-03-15 02:41:11,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1705 conditions, 936 events. 102/936 cut-off events. For 907/907 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5999 event pairs, 41 based on Foata normal form. 0/773 useless extension candidates. Maximal degree in co-relation 948. Up to 96 conditions per place. [2025-03-15 02:41:11,506 INFO L140 encePairwiseOnDemand]: 216/229 looper letters, 52 selfloop transitions, 14 changer transitions 14/273 dead transitions. [2025-03-15 02:41:11,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 273 transitions, 1169 flow [2025-03-15 02:41:11,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 02:41:11,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 02:41:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1961 transitions. [2025-03-15 02:41:11,510 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8563318777292577 [2025-03-15 02:41:11,512 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 24 predicate places. [2025-03-15 02:41:11,512 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 273 transitions, 1169 flow [2025-03-15 02:41:11,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 193.42857142857142) internal successors, (1354), 7 states have internal predecessors, (1354), 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 02:41:11,512 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:11,512 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:41:11,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 02:41:11,513 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:11,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:11,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2041002567, now seen corresponding path program 1 times [2025-03-15 02:41:11,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:11,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500227545] [2025-03-15 02:41:11,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:11,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:11,579 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 02:41:11,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:11,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500227545] [2025-03-15 02:41:11,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500227545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:41:11,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:41:11,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:41:11,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254649006] [2025-03-15 02:41:11,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:41:11,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:41:11,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:11,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:41:11,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:41:11,581 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 229 [2025-03-15 02:41:11,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 273 transitions, 1169 flow. Second operand has 4 states, 4 states have (on average 194.75) internal successors, (779), 4 states have internal predecessors, (779), 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 02:41:11,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:11,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 229 [2025-03-15 02:41:11,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:11,753 INFO L124 PetriNetUnfolderBase]: 174/1218 cut-off events. [2025-03-15 02:41:11,754 INFO L125 PetriNetUnfolderBase]: For 9136/10150 co-relation queries the response was YES. [2025-03-15 02:41:11,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2681 conditions, 1218 events. 174/1218 cut-off events. For 9136/10150 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 9123 event pairs, 67 based on Foata normal form. 0/1017 useless extension candidates. Maximal degree in co-relation 1048. Up to 170 conditions per place. [2025-03-15 02:41:11,763 INFO L140 encePairwiseOnDemand]: 221/229 looper letters, 42 selfloop transitions, 5 changer transitions 14/287 dead transitions. [2025-03-15 02:41:11,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 287 transitions, 1347 flow [2025-03-15 02:41:11,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:41:11,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:41:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 815 transitions. [2025-03-15 02:41:11,766 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8897379912663755 [2025-03-15 02:41:11,768 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 26 predicate places. [2025-03-15 02:41:11,768 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 287 transitions, 1347 flow [2025-03-15 02:41:11,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.75) internal successors, (779), 4 states have internal predecessors, (779), 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 02:41:11,768 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:11,768 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] [2025-03-15 02:41:11,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 02:41:11,768 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:11,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:11,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1153429228, now seen corresponding path program 1 times [2025-03-15 02:41:11,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:11,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255461719] [2025-03-15 02:41:11,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:11,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:11,876 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 02:41:11,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:11,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255461719] [2025-03-15 02:41:11,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255461719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:41:11,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:41:11,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:41:11,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156604395] [2025-03-15 02:41:11,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:41:11,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:41:11,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:11,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:41:11,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:41:11,878 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 229 [2025-03-15 02:41:11,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 287 transitions, 1347 flow. Second operand has 7 states, 7 states have (on average 193.57142857142858) internal successors, (1355), 7 states have internal predecessors, (1355), 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 02:41:11,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:11,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 229 [2025-03-15 02:41:11,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:12,049 INFO L124 PetriNetUnfolderBase]: 148/1038 cut-off events. [2025-03-15 02:41:12,049 INFO L125 PetriNetUnfolderBase]: For 3987/4041 co-relation queries the response was YES. [2025-03-15 02:41:12,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2466 conditions, 1038 events. 148/1038 cut-off events. For 3987/4041 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 7068 event pairs, 67 based on Foata normal form. 0/866 useless extension candidates. Maximal degree in co-relation 1404. Up to 139 conditions per place. [2025-03-15 02:41:12,055 INFO L140 encePairwiseOnDemand]: 216/229 looper letters, 47 selfloop transitions, 8 changer transitions 29/287 dead transitions. [2025-03-15 02:41:12,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 287 transitions, 1474 flow [2025-03-15 02:41:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 02:41:12,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 02:41:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1959 transitions. [2025-03-15 02:41:12,059 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8554585152838428 [2025-03-15 02:41:12,059 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 35 predicate places. [2025-03-15 02:41:12,059 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 287 transitions, 1474 flow [2025-03-15 02:41:12,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 193.57142857142858) internal successors, (1355), 7 states have internal predecessors, (1355), 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 02:41:12,060 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:12,061 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] [2025-03-15 02:41:12,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 02:41:12,061 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:12,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:12,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1118093647, now seen corresponding path program 1 times [2025-03-15 02:41:12,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:12,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188191433] [2025-03-15 02:41:12,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:12,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:12,507 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 02:41:12,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:12,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188191433] [2025-03-15 02:41:12,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188191433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:41:12,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675322592] [2025-03-15 02:41:12,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:12,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:41:12,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:41:12,510 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 02:41:12,511 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 02:41:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:12,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-15 02:41:12,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:41:12,620 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 1 [2025-03-15 02:41:12,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-15 02:41:12,758 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 02:41:12,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:41:12,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-15 02:41:12,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-15 02:41:12,955 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 02:41:12,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675322592] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:41:12,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:41:12,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 30 [2025-03-15 02:41:12,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567601722] [2025-03-15 02:41:12,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:41:12,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-15 02:41:12,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:12,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-15 02:41:12,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2025-03-15 02:41:12,960 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 229 [2025-03-15 02:41:12,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 287 transitions, 1474 flow. Second operand has 31 states, 31 states have (on average 163.5483870967742) internal successors, (5070), 31 states have internal predecessors, (5070), 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 02:41:12,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:12,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 229 [2025-03-15 02:41:12,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:14,093 INFO L124 PetriNetUnfolderBase]: 563/4494 cut-off events. [2025-03-15 02:41:14,093 INFO L125 PetriNetUnfolderBase]: For 8673/8909 co-relation queries the response was YES. [2025-03-15 02:41:14,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9776 conditions, 4494 events. 563/4494 cut-off events. For 8673/8909 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 43544 event pairs, 171 based on Foata normal form. 0/3710 useless extension candidates. Maximal degree in co-relation 4259. Up to 612 conditions per place. [2025-03-15 02:41:14,121 INFO L140 encePairwiseOnDemand]: 202/229 looper letters, 179 selfloop transitions, 35 changer transitions 30/410 dead transitions. [2025-03-15 02:41:14,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 410 transitions, 2680 flow [2025-03-15 02:41:14,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-15 02:41:14,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-15 02:41:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3889 transitions. [2025-03-15 02:41:14,129 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7383709891779001 [2025-03-15 02:41:14,129 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 57 predicate places. [2025-03-15 02:41:14,129 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 410 transitions, 2680 flow [2025-03-15 02:41:14,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 163.5483870967742) internal successors, (5070), 31 states have internal predecessors, (5070), 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 02:41:14,131 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:14,131 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:41:14,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-15 02:41:14,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:41:14,335 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:14,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:14,336 INFO L85 PathProgramCache]: Analyzing trace with hash -135853102, now seen corresponding path program 1 times [2025-03-15 02:41:14,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:14,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310184516] [2025-03-15 02:41:14,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:14,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:14,706 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 02:41:14,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:14,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310184516] [2025-03-15 02:41:14,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310184516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:41:14,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300546725] [2025-03-15 02:41:14,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:14,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:41:14,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:41:14,713 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 02:41:14,715 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 02:41:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:14,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-15 02:41:14,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:41:14,814 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 1 [2025-03-15 02:41:14,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-15 02:41:14,923 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 02:41:14,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:41:15,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-15 02:41:15,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-15 02:41:15,105 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 02:41:15,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300546725] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:41:15,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:41:15,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 30 [2025-03-15 02:41:15,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783748900] [2025-03-15 02:41:15,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:41:15,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-15 02:41:15,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:15,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-15 02:41:15,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2025-03-15 02:41:15,108 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 229 [2025-03-15 02:41:15,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 410 transitions, 2680 flow. Second operand has 31 states, 31 states have (on average 163.6451612903226) internal successors, (5073), 31 states have internal predecessors, (5073), 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 02:41:15,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:15,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 229 [2025-03-15 02:41:15,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:16,569 INFO L124 PetriNetUnfolderBase]: 978/7456 cut-off events. [2025-03-15 02:41:16,569 INFO L125 PetriNetUnfolderBase]: For 15053/17036 co-relation queries the response was YES. [2025-03-15 02:41:16,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17869 conditions, 7456 events. 978/7456 cut-off events. For 15053/17036 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 73033 event pairs, 288 based on Foata normal form. 127/6271 useless extension candidates. Maximal degree in co-relation 10152. Up to 1119 conditions per place. [2025-03-15 02:41:16,617 INFO L140 encePairwiseOnDemand]: 202/229 looper letters, 204 selfloop transitions, 41 changer transitions 30/525 dead transitions. [2025-03-15 02:41:16,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 525 transitions, 3868 flow [2025-03-15 02:41:16,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-15 02:41:16,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-15 02:41:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3889 transitions. [2025-03-15 02:41:16,623 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7383709891779001 [2025-03-15 02:41:16,624 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 79 predicate places. [2025-03-15 02:41:16,624 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 525 transitions, 3868 flow [2025-03-15 02:41:16,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 163.6451612903226) internal successors, (5073), 31 states have internal predecessors, (5073), 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 02:41:16,626 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:16,626 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] [2025-03-15 02:41:16,632 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 02:41:16,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:41:16,827 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:16,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:16,827 INFO L85 PathProgramCache]: Analyzing trace with hash 2097345302, now seen corresponding path program 1 times [2025-03-15 02:41:16,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:16,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806526826] [2025-03-15 02:41:16,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:16,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:17,242 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 02:41:17,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:17,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806526826] [2025-03-15 02:41:17,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806526826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:41:17,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879142382] [2025-03-15 02:41:17,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:17,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:41:17,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:41:17,247 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 02:41:17,252 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 02:41:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:17,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-15 02:41:17,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:41:17,337 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 1 [2025-03-15 02:41:17,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-15 02:41:17,447 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 02:41:17,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:41:17,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-15 02:41:17,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-15 02:41:17,607 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 02:41:17,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879142382] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:41:17,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:41:17,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 30 [2025-03-15 02:41:17,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140862846] [2025-03-15 02:41:17,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:41:17,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-15 02:41:17,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:17,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-15 02:41:17,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2025-03-15 02:41:17,610 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 229 [2025-03-15 02:41:17,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 525 transitions, 3868 flow. Second operand has 31 states, 31 states have (on average 163.5483870967742) internal successors, (5070), 31 states have internal predecessors, (5070), 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 02:41:17,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:17,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 229 [2025-03-15 02:41:17,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:19,096 INFO L124 PetriNetUnfolderBase]: 986/7553 cut-off events. [2025-03-15 02:41:19,096 INFO L125 PetriNetUnfolderBase]: For 17644/20321 co-relation queries the response was YES. [2025-03-15 02:41:19,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19592 conditions, 7553 events. 986/7553 cut-off events. For 17644/20321 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 74174 event pairs, 245 based on Foata normal form. 88/6279 useless extension candidates. Maximal degree in co-relation 11487. Up to 1201 conditions per place. [2025-03-15 02:41:19,137 INFO L140 encePairwiseOnDemand]: 202/229 looper letters, 226 selfloop transitions, 43 changer transitions 30/549 dead transitions. [2025-03-15 02:41:19,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 549 transitions, 4780 flow [2025-03-15 02:41:19,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-15 02:41:19,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-15 02:41:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3870 transitions. [2025-03-15 02:41:19,141 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7347636225555345 [2025-03-15 02:41:19,142 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 101 predicate places. [2025-03-15 02:41:19,142 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 549 transitions, 4780 flow [2025-03-15 02:41:19,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 163.5483870967742) internal successors, (5070), 31 states have internal predecessors, (5070), 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 02:41:19,143 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:19,143 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:41:19,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-15 02:41:19,348 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,SelfDestructingSolverStorable9 [2025-03-15 02:41:19,348 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:19,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:19,348 INFO L85 PathProgramCache]: Analyzing trace with hash 593195506, now seen corresponding path program 1 times [2025-03-15 02:41:19,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:19,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824506679] [2025-03-15 02:41:19,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:19,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:19,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:41:19,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:19,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824506679] [2025-03-15 02:41:19,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824506679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:41:19,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:41:19,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:41:19,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708111932] [2025-03-15 02:41:19,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:41:19,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:41:19,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:19,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:41:19,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:41:19,395 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 229 [2025-03-15 02:41:19,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 549 transitions, 4780 flow. Second operand has 4 states, 4 states have (on average 195.5) internal successors, (782), 4 states have internal predecessors, (782), 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 02:41:19,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:19,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 229 [2025-03-15 02:41:19,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:20,200 INFO L124 PetriNetUnfolderBase]: 963/7702 cut-off events. [2025-03-15 02:41:20,200 INFO L125 PetriNetUnfolderBase]: For 20492/21641 co-relation queries the response was YES. [2025-03-15 02:41:20,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20847 conditions, 7702 events. 963/7702 cut-off events. For 20492/21641 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 75539 event pairs, 263 based on Foata normal form. 63/6431 useless extension candidates. Maximal degree in co-relation 12391. Up to 1178 conditions per place. [2025-03-15 02:41:20,261 INFO L140 encePairwiseOnDemand]: 224/229 looper letters, 138 selfloop transitions, 12 changer transitions 30/555 dead transitions. [2025-03-15 02:41:20,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 555 transitions, 5297 flow [2025-03-15 02:41:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:41:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:41:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 812 transitions. [2025-03-15 02:41:20,263 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8864628820960698 [2025-03-15 02:41:20,264 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 104 predicate places. [2025-03-15 02:41:20,264 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 555 transitions, 5297 flow [2025-03-15 02:41:20,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 195.5) internal successors, (782), 4 states have internal predecessors, (782), 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 02:41:20,265 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:20,265 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:20,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 02:41:20,265 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:20,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:20,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1984680691, now seen corresponding path program 2 times [2025-03-15 02:41:20,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:20,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551920302] [2025-03-15 02:41:20,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:41:20,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:20,295 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:41:20,295 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:41:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:41:20,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:20,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551920302] [2025-03-15 02:41:20,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551920302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:41:20,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769246384] [2025-03-15 02:41:20,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:41:20,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:41:20,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:41:20,767 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 02:41:20,769 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 02:41:20,816 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:41:20,816 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:41:20,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-15 02:41:20,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:41:20,847 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 1 [2025-03-15 02:41:20,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 02:41:20,932 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 29 treesize of output 13 [2025-03-15 02:41:20,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-15 02:41:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:41:21,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:41:21,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-03-15 02:41:21,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2025-03-15 02:41:21,411 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:41:21,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769246384] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:41:21,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:41:21,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 14] total 32 [2025-03-15 02:41:21,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834175475] [2025-03-15 02:41:21,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:41:21,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-15 02:41:21,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:21,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-15 02:41:21,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=943, Unknown=0, NotChecked=0, Total=1056 [2025-03-15 02:41:21,415 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 229 [2025-03-15 02:41:21,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 555 transitions, 5297 flow. Second operand has 33 states, 33 states have (on average 158.96969696969697) internal successors, (5246), 33 states have internal predecessors, (5246), 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 02:41:21,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:21,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 229 [2025-03-15 02:41:21,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:23,488 INFO L124 PetriNetUnfolderBase]: 1166/9426 cut-off events. [2025-03-15 02:41:23,489 INFO L125 PetriNetUnfolderBase]: For 31450/39032 co-relation queries the response was YES. [2025-03-15 02:41:23,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29172 conditions, 9426 events. 1166/9426 cut-off events. For 31450/39032 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 99605 event pairs, 259 based on Foata normal form. 316/8072 useless extension candidates. Maximal degree in co-relation 13782. Up to 1161 conditions per place. [2025-03-15 02:41:23,549 INFO L140 encePairwiseOnDemand]: 200/229 looper letters, 288 selfloop transitions, 70 changer transitions 34/627 dead transitions. [2025-03-15 02:41:23,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 627 transitions, 7000 flow [2025-03-15 02:41:23,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-15 02:41:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-15 02:41:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4040 transitions. [2025-03-15 02:41:23,555 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7056768558951965 [2025-03-15 02:41:23,555 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 128 predicate places. [2025-03-15 02:41:23,555 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 627 transitions, 7000 flow [2025-03-15 02:41:23,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 158.96969696969697) internal successors, (5246), 33 states have internal predecessors, (5246), 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 02:41:23,558 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:23,558 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] [2025-03-15 02:41:23,564 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 02:41:23,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:41:23,762 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:23,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:23,762 INFO L85 PathProgramCache]: Analyzing trace with hash -208339053, now seen corresponding path program 1 times [2025-03-15 02:41:23,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:23,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79519852] [2025-03-15 02:41:23,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:23,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:23,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:41:23,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:23,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79519852] [2025-03-15 02:41:23,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79519852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:41:23,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:41:23,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:41:23,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674751357] [2025-03-15 02:41:23,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:41:23,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:41:23,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:23,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:41:23,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:41:23,810 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 229 [2025-03-15 02:41:23,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 627 transitions, 7000 flow. Second operand has 4 states, 4 states have (on average 195.75) internal successors, (783), 4 states have internal predecessors, (783), 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 02:41:23,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:23,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 229 [2025-03-15 02:41:23,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:24,989 INFO L124 PetriNetUnfolderBase]: 1196/9651 cut-off events. [2025-03-15 02:41:24,989 INFO L125 PetriNetUnfolderBase]: For 39506/45975 co-relation queries the response was YES. [2025-03-15 02:41:25,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32041 conditions, 9651 events. 1196/9651 cut-off events. For 39506/45975 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 102931 event pairs, 276 based on Foata normal form. 208/8160 useless extension candidates. Maximal degree in co-relation 15190. Up to 1191 conditions per place. [2025-03-15 02:41:25,060 INFO L140 encePairwiseOnDemand]: 224/229 looper letters, 198 selfloop transitions, 14 changer transitions 34/640 dead transitions. [2025-03-15 02:41:25,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 640 transitions, 7797 flow [2025-03-15 02:41:25,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:41:25,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:41:25,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 809 transitions. [2025-03-15 02:41:25,061 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8831877729257642 [2025-03-15 02:41:25,062 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 130 predicate places. [2025-03-15 02:41:25,062 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 640 transitions, 7797 flow [2025-03-15 02:41:25,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 195.75) internal successors, (783), 4 states have internal predecessors, (783), 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 02:41:25,062 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:25,062 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:25,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 02:41:25,062 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:25,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:25,063 INFO L85 PathProgramCache]: Analyzing trace with hash 357685566, now seen corresponding path program 2 times [2025-03-15 02:41:25,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:25,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256497233] [2025-03-15 02:41:25,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:41:25,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:25,072 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:41:25,072 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:41:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-15 02:41:25,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:25,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256497233] [2025-03-15 02:41:25,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256497233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:41:25,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415996905] [2025-03-15 02:41:25,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:41:25,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:41:25,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:41:25,116 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 02:41:25,117 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 02:41:25,160 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:41:25,160 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:41:25,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-15 02:41:25,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:41:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-15 02:41:25,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:41:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-15 02:41:25,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415996905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:41:25,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:41:25,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2025-03-15 02:41:25,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127608937] [2025-03-15 02:41:25,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:41:25,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:41:25,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:25,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:41:25,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:41:25,294 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 229 [2025-03-15 02:41:25,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 640 transitions, 7797 flow. Second operand has 8 states, 8 states have (on average 189.125) internal successors, (1513), 8 states have internal predecessors, (1513), 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 02:41:25,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:25,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 229 [2025-03-15 02:41:25,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:26,383 INFO L124 PetriNetUnfolderBase]: 1206/9334 cut-off events. [2025-03-15 02:41:26,383 INFO L125 PetriNetUnfolderBase]: For 44596/51765 co-relation queries the response was YES. [2025-03-15 02:41:26,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32437 conditions, 9334 events. 1206/9334 cut-off events. For 44596/51765 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 97805 event pairs, 290 based on Foata normal form. 166/7841 useless extension candidates. Maximal degree in co-relation 14800. Up to 1225 conditions per place. [2025-03-15 02:41:26,465 INFO L140 encePairwiseOnDemand]: 215/229 looper letters, 126 selfloop transitions, 27 changer transitions 34/639 dead transitions. [2025-03-15 02:41:26,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 639 transitions, 8125 flow [2025-03-15 02:41:26,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 02:41:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 02:41:26,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1710 transitions. [2025-03-15 02:41:26,466 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8296943231441049 [2025-03-15 02:41:26,467 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 137 predicate places. [2025-03-15 02:41:26,467 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 639 transitions, 8125 flow [2025-03-15 02:41:26,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 189.125) internal successors, (1513), 8 states have internal predecessors, (1513), 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 02:41:26,468 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:26,468 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:41:26,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-15 02:41:26,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:41:26,668 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:26,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:26,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1807782759, now seen corresponding path program 1 times [2025-03-15 02:41:26,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:26,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546957362] [2025-03-15 02:41:26,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:26,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:26,920 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 02:41:26,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:26,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546957362] [2025-03-15 02:41:26,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546957362] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:41:26,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460062967] [2025-03-15 02:41:26,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:26,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:41:26,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:41:26,922 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 02:41:26,924 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 02:41:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:26,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-15 02:41:26,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:41:27,006 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 1 [2025-03-15 02:41:27,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-15 02:41:27,125 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 02:41:27,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:41:27,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-15 02:41:27,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-15 02:41:27,307 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 02:41:27,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460062967] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:41:27,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:41:27,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 30 [2025-03-15 02:41:27,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288245927] [2025-03-15 02:41:27,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:41:27,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-15 02:41:27,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:27,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-15 02:41:27,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2025-03-15 02:41:27,311 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 229 [2025-03-15 02:41:27,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 639 transitions, 8125 flow. Second operand has 31 states, 31 states have (on average 163.6451612903226) internal successors, (5073), 31 states have internal predecessors, (5073), 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 02:41:27,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:27,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 229 [2025-03-15 02:41:27,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:29,129 INFO L124 PetriNetUnfolderBase]: 1232/9901 cut-off events. [2025-03-15 02:41:29,129 INFO L125 PetriNetUnfolderBase]: For 49360/57579 co-relation queries the response was YES. [2025-03-15 02:41:29,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36074 conditions, 9901 events. 1232/9901 cut-off events. For 49360/57579 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 104102 event pairs, 259 based on Foata normal form. 232/8419 useless extension candidates. Maximal degree in co-relation 17161. Up to 1206 conditions per place. [2025-03-15 02:41:29,215 INFO L140 encePairwiseOnDemand]: 202/229 looper letters, 298 selfloop transitions, 47 changer transitions 34/668 dead transitions. [2025-03-15 02:41:29,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 668 transitions, 9417 flow [2025-03-15 02:41:29,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-15 02:41:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-15 02:41:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3870 transitions. [2025-03-15 02:41:29,217 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7347636225555345 [2025-03-15 02:41:29,218 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 159 predicate places. [2025-03-15 02:41:29,218 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 668 transitions, 9417 flow [2025-03-15 02:41:29,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 163.6451612903226) internal successors, (5073), 31 states have internal predecessors, (5073), 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 02:41:29,219 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:29,219 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] [2025-03-15 02:41:29,225 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 02:41:29,423 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,SelfDestructingSolverStorable14 [2025-03-15 02:41:29,423 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:29,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:29,423 INFO L85 PathProgramCache]: Analyzing trace with hash -825648041, now seen corresponding path program 1 times [2025-03-15 02:41:29,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:29,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461262945] [2025-03-15 02:41:29,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:29,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:41:29,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:29,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461262945] [2025-03-15 02:41:29,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461262945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:41:29,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:41:29,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 02:41:29,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143526983] [2025-03-15 02:41:29,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:41:29,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:41:29,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:29,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:41:29,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:41:29,489 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 229 [2025-03-15 02:41:29,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 668 transitions, 9417 flow. Second operand has 7 states, 7 states have (on average 186.71428571428572) internal successors, (1307), 7 states have internal predecessors, (1307), 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 02:41:29,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:29,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 229 [2025-03-15 02:41:29,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:32,030 INFO L124 PetriNetUnfolderBase]: 2300/17526 cut-off events. [2025-03-15 02:41:32,030 INFO L125 PetriNetUnfolderBase]: For 96528/111767 co-relation queries the response was YES. [2025-03-15 02:41:32,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58917 conditions, 17526 events. 2300/17526 cut-off events. For 96528/111767 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 225898 event pairs, 625 based on Foata normal form. 229/14473 useless extension candidates. Maximal degree in co-relation 30452. Up to 2588 conditions per place. [2025-03-15 02:41:32,159 INFO L140 encePairwiseOnDemand]: 217/229 looper letters, 383 selfloop transitions, 41 changer transitions 37/858 dead transitions. [2025-03-15 02:41:32,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 858 transitions, 13084 flow [2025-03-15 02:41:32,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 02:41:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 02:41:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2163 transitions. [2025-03-15 02:41:32,165 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8586740770146883 [2025-03-15 02:41:32,165 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 169 predicate places. [2025-03-15 02:41:32,165 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 858 transitions, 13084 flow [2025-03-15 02:41:32,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 186.71428571428572) internal successors, (1307), 7 states have internal predecessors, (1307), 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 02:41:32,165 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:32,166 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] [2025-03-15 02:41:32,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 02:41:32,166 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:32,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:32,166 INFO L85 PathProgramCache]: Analyzing trace with hash -206690029, now seen corresponding path program 1 times [2025-03-15 02:41:32,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:32,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628206531] [2025-03-15 02:41:32,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:32,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:41:32,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:32,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628206531] [2025-03-15 02:41:32,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628206531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:41:32,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:41:32,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:41:32,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315028167] [2025-03-15 02:41:32,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:41:32,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:41:32,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:32,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:41:32,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:41:32,196 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 229 [2025-03-15 02:41:32,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 858 transitions, 13084 flow. Second operand has 4 states, 4 states have (on average 195.75) internal successors, (783), 4 states have internal predecessors, (783), 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 02:41:32,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:32,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 229 [2025-03-15 02:41:32,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:34,929 INFO L124 PetriNetUnfolderBase]: 2268/17707 cut-off events. [2025-03-15 02:41:34,930 INFO L125 PetriNetUnfolderBase]: For 96007/105364 co-relation queries the response was YES. [2025-03-15 02:41:35,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63673 conditions, 17707 events. 2268/17707 cut-off events. For 96007/105364 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 228604 event pairs, 660 based on Foata normal form. 154/14658 useless extension candidates. Maximal degree in co-relation 31460. Up to 2695 conditions per place. [2025-03-15 02:41:35,076 INFO L140 encePairwiseOnDemand]: 224/229 looper letters, 216 selfloop transitions, 12 changer transitions 37/870 dead transitions. [2025-03-15 02:41:35,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 870 transitions, 14091 flow [2025-03-15 02:41:35,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:41:35,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:41:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 812 transitions. [2025-03-15 02:41:35,078 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8864628820960698 [2025-03-15 02:41:35,078 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 172 predicate places. [2025-03-15 02:41:35,078 INFO L471 AbstractCegarLoop]: Abstraction has has 394 places, 870 transitions, 14091 flow [2025-03-15 02:41:35,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 195.75) internal successors, (783), 4 states have internal predecessors, (783), 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 02:41:35,078 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:35,079 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:41:35,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 02:41:35,079 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:35,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:35,079 INFO L85 PathProgramCache]: Analyzing trace with hash 174715101, now seen corresponding path program 1 times [2025-03-15 02:41:35,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:35,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166491258] [2025-03-15 02:41:35,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:35,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:35,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:41:35,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:35,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166491258] [2025-03-15 02:41:35,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166491258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:41:35,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:41:35,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 02:41:35,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841334735] [2025-03-15 02:41:35,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:41:35,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:41:35,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:35,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:41:35,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:41:35,142 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 229 [2025-03-15 02:41:35,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 870 transitions, 14091 flow. Second operand has 7 states, 7 states have (on average 186.85714285714286) internal successors, (1308), 7 states have internal predecessors, (1308), 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 02:41:35,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:35,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 229 [2025-03-15 02:41:35,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:38,220 INFO L124 PetriNetUnfolderBase]: 2458/19892 cut-off events. [2025-03-15 02:41:38,221 INFO L125 PetriNetUnfolderBase]: For 107831/127040 co-relation queries the response was YES. [2025-03-15 02:41:38,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72916 conditions, 19892 events. 2458/19892 cut-off events. For 107831/127040 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 267132 event pairs, 656 based on Foata normal form. 243/16521 useless extension candidates. Maximal degree in co-relation 36891. Up to 3068 conditions per place. [2025-03-15 02:41:38,420 INFO L140 encePairwiseOnDemand]: 217/229 looper letters, 419 selfloop transitions, 50 changer transitions 37/912 dead transitions. [2025-03-15 02:41:38,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 912 transitions, 15551 flow [2025-03-15 02:41:38,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 02:41:38,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 02:41:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2345 transitions. [2025-03-15 02:41:38,422 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8533478893740902 [2025-03-15 02:41:38,422 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 183 predicate places. [2025-03-15 02:41:38,423 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 912 transitions, 15551 flow [2025-03-15 02:41:38,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 186.85714285714286) internal successors, (1308), 7 states have internal predecessors, (1308), 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 02:41:38,423 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:38,423 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:38,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 02:41:38,423 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:38,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:38,424 INFO L85 PathProgramCache]: Analyzing trace with hash -178638576, now seen corresponding path program 2 times [2025-03-15 02:41:38,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:38,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498252850] [2025-03-15 02:41:38,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:41:38,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:38,435 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:41:38,435 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:41:38,789 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:41:38,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:38,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498252850] [2025-03-15 02:41:38,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498252850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:41:38,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075621214] [2025-03-15 02:41:38,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:41:38,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:41:38,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:41:38,791 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 02:41:38,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-15 02:41:38,856 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:41:38,856 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:41:38,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-15 02:41:38,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:41:38,885 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 1 [2025-03-15 02:41:38,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 02:41:38,962 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 27 treesize of output 11 [2025-03-15 02:41:39,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-15 02:41:39,058 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:41:39,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:41:39,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-03-15 02:41:39,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2025-03-15 02:41:39,407 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:41:39,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075621214] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:41:39,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:41:39,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 14] total 32 [2025-03-15 02:41:39,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886899130] [2025-03-15 02:41:39,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:41:39,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-15 02:41:39,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:39,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-15 02:41:39,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=943, Unknown=0, NotChecked=0, Total=1056 [2025-03-15 02:41:39,414 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 229 [2025-03-15 02:41:39,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 912 transitions, 15551 flow. Second operand has 33 states, 33 states have (on average 159.03030303030303) internal successors, (5248), 33 states have internal predecessors, (5248), 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 02:41:39,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:39,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 229 [2025-03-15 02:41:39,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:43,995 INFO L124 PetriNetUnfolderBase]: 2833/23800 cut-off events. [2025-03-15 02:41:43,995 INFO L125 PetriNetUnfolderBase]: For 136526/154219 co-relation queries the response was YES. [2025-03-15 02:41:44,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93810 conditions, 23800 events. 2833/23800 cut-off events. For 136526/154219 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 321539 event pairs, 815 based on Foata normal form. 314/19769 useless extension candidates. Maximal degree in co-relation 43050. Up to 3942 conditions per place. [2025-03-15 02:41:44,229 INFO L140 encePairwiseOnDemand]: 200/229 looper letters, 431 selfloop transitions, 107 changer transitions 37/1007 dead transitions. [2025-03-15 02:41:44,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 1007 transitions, 18311 flow [2025-03-15 02:41:44,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-15 02:41:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-15 02:41:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4039 transitions. [2025-03-15 02:41:44,231 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7055021834061136 [2025-03-15 02:41:44,231 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 207 predicate places. [2025-03-15 02:41:44,231 INFO L471 AbstractCegarLoop]: Abstraction has has 429 places, 1007 transitions, 18311 flow [2025-03-15 02:41:44,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 159.03030303030303) internal successors, (5248), 33 states have internal predecessors, (5248), 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 02:41:44,232 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:44,232 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:41:44,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-15 02:41:44,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:41:44,433 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:44,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:44,433 INFO L85 PathProgramCache]: Analyzing trace with hash -474960584, now seen corresponding path program 1 times [2025-03-15 02:41:44,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:44,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286141474] [2025-03-15 02:41:44,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:44,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:41:44,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:44,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286141474] [2025-03-15 02:41:44,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286141474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:41:44,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:41:44,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:41:44,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329093726] [2025-03-15 02:41:44,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:41:44,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:41:44,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:44,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:41:44,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:41:44,491 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 229 [2025-03-15 02:41:44,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 1007 transitions, 18311 flow. Second operand has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 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 02:41:44,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:44,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 229 [2025-03-15 02:41:44,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:48,721 INFO L124 PetriNetUnfolderBase]: 2903/23070 cut-off events. [2025-03-15 02:41:48,721 INFO L125 PetriNetUnfolderBase]: For 174237/192537 co-relation queries the response was YES. [2025-03-15 02:41:48,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97575 conditions, 23070 events. 2903/23070 cut-off events. For 174237/192537 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 309985 event pairs, 806 based on Foata normal form. 265/19181 useless extension candidates. Maximal degree in co-relation 45563. Up to 3940 conditions per place. [2025-03-15 02:41:48,922 INFO L140 encePairwiseOnDemand]: 220/229 looper letters, 418 selfloop transitions, 50 changer transitions 37/1046 dead transitions. [2025-03-15 02:41:48,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 1046 transitions, 20541 flow [2025-03-15 02:41:48,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:41:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:41:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1317 transitions. [2025-03-15 02:41:48,924 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8215845290081097 [2025-03-15 02:41:48,924 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 213 predicate places. [2025-03-15 02:41:48,924 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 1046 transitions, 20541 flow [2025-03-15 02:41:48,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 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 02:41:48,924 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:48,924 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] [2025-03-15 02:41:48,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 02:41:48,925 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:48,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:48,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1119686506, now seen corresponding path program 1 times [2025-03-15 02:41:48,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:48,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152312247] [2025-03-15 02:41:48,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:48,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:41:48,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:48,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152312247] [2025-03-15 02:41:48,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152312247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:41:48,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:41:48,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:41:48,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316695655] [2025-03-15 02:41:48,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:41:48,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:41:48,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:48,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:41:48,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:41:48,957 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 229 [2025-03-15 02:41:48,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 1046 transitions, 20541 flow. Second operand has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 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 02:41:48,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:48,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 229 [2025-03-15 02:41:48,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:53,391 INFO L124 PetriNetUnfolderBase]: 3010/23276 cut-off events. [2025-03-15 02:41:53,392 INFO L125 PetriNetUnfolderBase]: For 212152/237319 co-relation queries the response was YES. [2025-03-15 02:41:53,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105246 conditions, 23276 events. 3010/23276 cut-off events. For 212152/237319 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 311733 event pairs, 763 based on Foata normal form. 389/19457 useless extension candidates. Maximal degree in co-relation 47458. Up to 4092 conditions per place. [2025-03-15 02:41:53,646 INFO L140 encePairwiseOnDemand]: 224/229 looper letters, 318 selfloop transitions, 14 changer transitions 47/1064 dead transitions. [2025-03-15 02:41:53,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 1064 transitions, 22077 flow [2025-03-15 02:41:53,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:41:53,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:41:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 809 transitions. [2025-03-15 02:41:53,647 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8831877729257642 [2025-03-15 02:41:53,647 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 215 predicate places. [2025-03-15 02:41:53,647 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 1064 transitions, 22077 flow [2025-03-15 02:41:53,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 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 02:41:53,648 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:53,648 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:53,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 02:41:53,648 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:53,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:53,648 INFO L85 PathProgramCache]: Analyzing trace with hash -364789548, now seen corresponding path program 2 times [2025-03-15 02:41:53,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:53,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601487732] [2025-03-15 02:41:53,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:41:53,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:53,658 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:41:53,658 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:41:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:41:54,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:54,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601487732] [2025-03-15 02:41:54,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601487732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:41:54,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749472645] [2025-03-15 02:41:54,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:41:54,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:41:54,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:41:54,068 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:41:54,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-15 02:41:54,125 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:41:54,125 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:41:54,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-15 02:41:54,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:41:54,145 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 1 [2025-03-15 02:41:54,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 02:41:54,220 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 27 treesize of output 11 [2025-03-15 02:41:54,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-15 02:41:54,316 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:41:54,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:41:54,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-03-15 02:41:54,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2025-03-15 02:41:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:41:54,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749472645] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:41:54,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:41:54,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 14] total 33 [2025-03-15 02:41:54,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559787729] [2025-03-15 02:41:54,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:41:54,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-15 02:41:54,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:54,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-15 02:41:54,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1005, Unknown=0, NotChecked=0, Total=1122 [2025-03-15 02:41:54,646 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 229 [2025-03-15 02:41:54,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 1064 transitions, 22077 flow. Second operand has 34 states, 34 states have (on average 158.94117647058823) internal successors, (5404), 34 states have internal predecessors, (5404), 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 02:41:54,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:54,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 229 [2025-03-15 02:41:54,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:59,040 INFO L124 PetriNetUnfolderBase]: 2960/23020 cut-off events. [2025-03-15 02:41:59,041 INFO L125 PetriNetUnfolderBase]: For 230130/250352 co-relation queries the response was YES. [2025-03-15 02:41:59,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108533 conditions, 23020 events. 2960/23020 cut-off events. For 230130/250352 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 308815 event pairs, 806 based on Foata normal form. 543/19414 useless extension candidates. Maximal degree in co-relation 49354. Up to 3920 conditions per place. [2025-03-15 02:41:59,284 INFO L140 encePairwiseOnDemand]: 201/229 looper letters, 528 selfloop transitions, 108 changer transitions 47/1058 dead transitions. [2025-03-15 02:41:59,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 1058 transitions, 23272 flow [2025-03-15 02:41:59,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-15 02:41:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-15 02:41:59,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4028 transitions. [2025-03-15 02:41:59,287 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7035807860262009 [2025-03-15 02:41:59,287 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 239 predicate places. [2025-03-15 02:41:59,287 INFO L471 AbstractCegarLoop]: Abstraction has has 461 places, 1058 transitions, 23272 flow [2025-03-15 02:41:59,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 158.94117647058823) internal successors, (5404), 34 states have internal predecessors, (5404), 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 02:41:59,288 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:59,288 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] [2025-03-15 02:41:59,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-15 02:41:59,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-15 02:41:59,492 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:41:59,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:59,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1083305619, now seen corresponding path program 1 times [2025-03-15 02:41:59,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:59,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453092535] [2025-03-15 02:41:59,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:59,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:59,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:41:59,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:59,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453092535] [2025-03-15 02:41:59,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453092535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:41:59,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:41:59,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:41:59,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156974159] [2025-03-15 02:41:59,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:41:59,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:41:59,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:59,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:41:59,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:41:59,553 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 229 [2025-03-15 02:41:59,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 1058 transitions, 23272 flow. Second operand has 6 states, 6 states have (on average 183.16666666666666) internal successors, (1099), 6 states have internal predecessors, (1099), 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 02:41:59,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:59,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 229 [2025-03-15 02:41:59,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:42:03,701 INFO L124 PetriNetUnfolderBase]: 2939/22832 cut-off events. [2025-03-15 02:42:03,701 INFO L125 PetriNetUnfolderBase]: For 243307/263607 co-relation queries the response was YES. [2025-03-15 02:42:03,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110942 conditions, 22832 events. 2939/22832 cut-off events. For 243307/263607 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 304770 event pairs, 767 based on Foata normal form. 228/18991 useless extension candidates. Maximal degree in co-relation 50213. Up to 3955 conditions per place. [2025-03-15 02:42:04,021 INFO L140 encePairwiseOnDemand]: 219/229 looper letters, 446 selfloop transitions, 56 changer transitions 47/1086 dead transitions. [2025-03-15 02:42:04,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 1086 transitions, 25634 flow [2025-03-15 02:42:04,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:42:04,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:42:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1310 transitions. [2025-03-15 02:42:04,022 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8172177167810356 [2025-03-15 02:42:04,022 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 245 predicate places. [2025-03-15 02:42:04,022 INFO L471 AbstractCegarLoop]: Abstraction has has 467 places, 1086 transitions, 25634 flow [2025-03-15 02:42:04,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 183.16666666666666) internal successors, (1099), 6 states have internal predecessors, (1099), 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 02:42:04,022 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:42:04,023 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:42:04,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 02:42:04,023 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:42:04,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:42:04,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2005692472, now seen corresponding path program 1 times [2025-03-15 02:42:04,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:42:04,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312578204] [2025-03-15 02:42:04,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:42:04,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:42:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:42:04,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:42:04,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:42:04,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312578204] [2025-03-15 02:42:04,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312578204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:42:04,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:42:04,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 02:42:04,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308880449] [2025-03-15 02:42:04,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:42:04,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:42:04,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:42:04,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:42:04,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:42:04,077 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 229 [2025-03-15 02:42:04,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 1086 transitions, 25634 flow. Second operand has 7 states, 7 states have (on average 186.85714285714286) internal successors, (1308), 7 states have internal predecessors, (1308), 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 02:42:04,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:42:04,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 229 [2025-03-15 02:42:04,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:42:11,533 INFO L124 PetriNetUnfolderBase]: 4109/33180 cut-off events. [2025-03-15 02:42:11,534 INFO L125 PetriNetUnfolderBase]: For 355886/375060 co-relation queries the response was YES. [2025-03-15 02:42:11,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179343 conditions, 33180 events. 4109/33180 cut-off events. For 355886/375060 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 476486 event pairs, 1148 based on Foata normal form. 256/27686 useless extension candidates. Maximal degree in co-relation 85485. Up to 6950 conditions per place. [2025-03-15 02:42:11,919 INFO L140 encePairwiseOnDemand]: 216/229 looper letters, 559 selfloop transitions, 70 changer transitions 50/1282 dead transitions. [2025-03-15 02:42:11,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 1282 transitions, 30765 flow [2025-03-15 02:42:11,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 02:42:11,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 02:42:11,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2355 transitions. [2025-03-15 02:42:11,921 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8569868995633187 [2025-03-15 02:42:11,922 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 256 predicate places. [2025-03-15 02:42:11,922 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 1282 transitions, 30765 flow [2025-03-15 02:42:11,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 186.85714285714286) internal successors, (1308), 7 states have internal predecessors, (1308), 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 02:42:11,922 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:42:11,922 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:42:11,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-15 02:42:11,922 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:42:11,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:42:11,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2046925152, now seen corresponding path program 1 times [2025-03-15 02:42:11,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:42:11,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007773687] [2025-03-15 02:42:11,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:42:11,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:42:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:42:11,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:42:11,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:42:11,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007773687] [2025-03-15 02:42:11,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007773687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:42:11,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:42:11,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 02:42:11,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307532070] [2025-03-15 02:42:11,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:42:11,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:42:11,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:42:11,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:42:11,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:42:11,977 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 229 [2025-03-15 02:42:11,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 1282 transitions, 30765 flow. Second operand has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 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 02:42:11,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:42:11,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 229 [2025-03-15 02:42:11,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:42:20,076 INFO L124 PetriNetUnfolderBase]: 4352/35036 cut-off events. [2025-03-15 02:42:20,076 INFO L125 PetriNetUnfolderBase]: For 396302/426149 co-relation queries the response was YES. [2025-03-15 02:42:20,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198421 conditions, 35036 events. 4352/35036 cut-off events. For 396302/426149 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 510465 event pairs, 1059 based on Foata normal form. 231/29210 useless extension candidates. Maximal degree in co-relation 94423. Up to 7431 conditions per place. [2025-03-15 02:42:20,545 INFO L140 encePairwiseOnDemand]: 217/229 looper letters, 596 selfloop transitions, 74 changer transitions 50/1335 dead transitions. [2025-03-15 02:42:20,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 1335 transitions, 33527 flow [2025-03-15 02:42:20,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 02:42:20,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 02:42:20,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2349 transitions. [2025-03-15 02:42:20,547 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8548034934497817 [2025-03-15 02:42:20,547 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 267 predicate places. [2025-03-15 02:42:20,547 INFO L471 AbstractCegarLoop]: Abstraction has has 489 places, 1335 transitions, 33527 flow [2025-03-15 02:42:20,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 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 02:42:20,548 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:42:20,548 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:42:20,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-15 02:42:20,548 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:42:20,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:42:20,549 INFO L85 PathProgramCache]: Analyzing trace with hash -872396421, now seen corresponding path program 1 times [2025-03-15 02:42:20,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:42:20,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887139776] [2025-03-15 02:42:20,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:42:20,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:42:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:42:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:42:20,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:42:20,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887139776] [2025-03-15 02:42:20,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887139776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:42:20,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:42:20,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:42:20,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937318045] [2025-03-15 02:42:20,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:42:20,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:42:20,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:42:20,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:42:20,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:42:20,602 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 229 [2025-03-15 02:42:20,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 1335 transitions, 33527 flow. Second operand has 6 states, 6 states have (on average 183.16666666666666) internal successors, (1099), 6 states have internal predecessors, (1099), 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 02:42:20,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:42:20,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 229 [2025-03-15 02:42:20,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:42:30,569 INFO L124 PetriNetUnfolderBase]: 4543/35210 cut-off events. [2025-03-15 02:42:30,569 INFO L125 PetriNetUnfolderBase]: For 529811/555683 co-relation queries the response was YES. [2025-03-15 02:42:30,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216948 conditions, 35210 events. 4543/35210 cut-off events. For 529811/555683 co-relation queries the response was YES. Maximal size of possible extension queue 752. Compared 511253 event pairs, 1151 based on Foata normal form. 211/29511 useless extension candidates. Maximal degree in co-relation 99601. Up to 7391 conditions per place. [2025-03-15 02:42:31,065 INFO L140 encePairwiseOnDemand]: 220/229 looper letters, 549 selfloop transitions, 50 changer transitions 74/1406 dead transitions. [2025-03-15 02:42:31,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 1406 transitions, 38237 flow [2025-03-15 02:42:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:42:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:42:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1317 transitions. [2025-03-15 02:42:31,066 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8215845290081097 [2025-03-15 02:42:31,067 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 273 predicate places. [2025-03-15 02:42:31,067 INFO L471 AbstractCegarLoop]: Abstraction has has 495 places, 1406 transitions, 38237 flow [2025-03-15 02:42:31,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 183.16666666666666) internal successors, (1099), 6 states have internal predecessors, (1099), 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 02:42:31,067 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:42:31,067 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:42:31,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-15 02:42:31,067 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:42:31,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:42:31,068 INFO L85 PathProgramCache]: Analyzing trace with hash 995128279, now seen corresponding path program 2 times [2025-03-15 02:42:31,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:42:31,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310508052] [2025-03-15 02:42:31,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:42:31,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:42:31,077 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:42:31,077 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:42:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:42:31,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:42:31,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310508052] [2025-03-15 02:42:31,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310508052] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:42:31,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125011353] [2025-03-15 02:42:31,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:42:31,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:42:31,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:42:31,508 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:42:31,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-15 02:42:31,562 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:42:31,562 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:42:31,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-15 02:42:31,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:42:31,581 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 1 [2025-03-15 02:42:31,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 02:42:31,643 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 29 treesize of output 13 [2025-03-15 02:42:31,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-15 02:42:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:42:31,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:42:31,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-03-15 02:42:31,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2025-03-15 02:42:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:42:32,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125011353] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:42:32,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:42:32,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 14] total 32 [2025-03-15 02:42:32,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587520720] [2025-03-15 02:42:32,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:42:32,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-15 02:42:32,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:42:32,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-15 02:42:32,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=943, Unknown=0, NotChecked=0, Total=1056 [2025-03-15 02:42:32,007 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 229 [2025-03-15 02:42:32,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 1406 transitions, 38237 flow. Second operand has 33 states, 33 states have (on average 159.03030303030303) internal successors, (5248), 33 states have internal predecessors, (5248), 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 02:42:32,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:42:32,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 229 [2025-03-15 02:42:32,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:42:41,432 INFO L124 PetriNetUnfolderBase]: 4526/35064 cut-off events. [2025-03-15 02:42:41,433 INFO L125 PetriNetUnfolderBase]: For 577794/605378 co-relation queries the response was YES. [2025-03-15 02:42:41,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224887 conditions, 35064 events. 4526/35064 cut-off events. For 577794/605378 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 509277 event pairs, 1153 based on Foata normal form. 497/29697 useless extension candidates. Maximal degree in co-relation 108704. Up to 7391 conditions per place. [2025-03-15 02:42:42,137 INFO L140 encePairwiseOnDemand]: 201/229 looper letters, 664 selfloop transitions, 125 changer transitions 74/1398 dead transitions. [2025-03-15 02:42:42,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 1398 transitions, 39664 flow [2025-03-15 02:42:42,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-15 02:42:42,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-15 02:42:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4028 transitions. [2025-03-15 02:42:42,139 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7035807860262009 [2025-03-15 02:42:42,140 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 297 predicate places. [2025-03-15 02:42:42,140 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 1398 transitions, 39664 flow [2025-03-15 02:42:42,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 159.03030303030303) internal successors, (5248), 33 states have internal predecessors, (5248), 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 02:42:42,140 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:42:42,141 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:42:42,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-15 02:42:42,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-15 02:42:42,341 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:42:42,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:42:42,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1647696628, now seen corresponding path program 1 times [2025-03-15 02:42:42,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:42:42,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897385704] [2025-03-15 02:42:42,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:42:42,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:42:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:42:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:42:42,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:42:42,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897385704] [2025-03-15 02:42:42,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897385704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:42:42,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:42:42,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:42:42,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654731990] [2025-03-15 02:42:42,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:42:42,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:42:42,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:42:42,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:42:42,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:42:42,386 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 229 [2025-03-15 02:42:42,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 1398 transitions, 39664 flow. Second operand has 6 states, 6 states have (on average 183.33333333333334) internal successors, (1100), 6 states have internal predecessors, (1100), 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 02:42:42,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:42:42,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 229 [2025-03-15 02:42:42,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:42:53,276 INFO L124 PetriNetUnfolderBase]: 4498/34800 cut-off events. [2025-03-15 02:42:53,276 INFO L125 PetriNetUnfolderBase]: For 603703/634806 co-relation queries the response was YES. [2025-03-15 02:42:53,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235467 conditions, 34800 events. 4498/34800 cut-off events. For 603703/634806 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 503954 event pairs, 1136 based on Foata normal form. 192/29305 useless extension candidates. Maximal degree in co-relation 107654. Up to 8718 conditions per place. [2025-03-15 02:42:53,833 INFO L140 encePairwiseOnDemand]: 219/229 looper letters, 579 selfloop transitions, 56 changer transitions 90/1456 dead transitions. [2025-03-15 02:42:53,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 1456 transitions, 44448 flow [2025-03-15 02:42:53,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:42:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:42:53,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1310 transitions. [2025-03-15 02:42:53,834 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8172177167810356 [2025-03-15 02:42:53,835 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 303 predicate places. [2025-03-15 02:42:53,835 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 1456 transitions, 44448 flow [2025-03-15 02:42:53,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 183.33333333333334) internal successors, (1100), 6 states have internal predecessors, (1100), 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 02:42:53,835 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:42:53,835 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] [2025-03-15 02:42:53,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-15 02:42:53,835 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:42:53,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:42:53,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1237700316, now seen corresponding path program 1 times [2025-03-15 02:42:53,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:42:53,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180321294] [2025-03-15 02:42:53,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:42:53,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:42:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:42:53,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:42:53,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:42:53,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180321294] [2025-03-15 02:42:53,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180321294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:42:53,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:42:53,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:42:53,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74427491] [2025-03-15 02:42:53,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:42:53,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:42:53,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:42:53,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:42:53,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:42:53,864 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 229 [2025-03-15 02:42:53,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 1456 transitions, 44448 flow. Second operand has 4 states, 4 states have (on average 206.5) internal successors, (826), 4 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:42:53,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:42:53,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 229 [2025-03-15 02:42:53,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:43:03,162 INFO L124 PetriNetUnfolderBase]: 4512/34338 cut-off events. [2025-03-15 02:43:03,163 INFO L125 PetriNetUnfolderBase]: For 636089/662338 co-relation queries the response was YES. [2025-03-15 02:43:03,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237099 conditions, 34338 events. 4512/34338 cut-off events. For 636089/662338 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 495999 event pairs, 1207 based on Foata normal form. 504/29398 useless extension candidates. Maximal degree in co-relation 113130. Up to 8252 conditions per place. [2025-03-15 02:43:03,841 INFO L140 encePairwiseOnDemand]: 222/229 looper letters, 440 selfloop transitions, 9 changer transitions 90/1463 dead transitions. [2025-03-15 02:43:03,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 1463 transitions, 45730 flow [2025-03-15 02:43:03,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:43:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:43:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1055 transitions. [2025-03-15 02:43:03,843 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9213973799126638 [2025-03-15 02:43:03,843 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 307 predicate places. [2025-03-15 02:43:03,843 INFO L471 AbstractCegarLoop]: Abstraction has has 529 places, 1463 transitions, 45730 flow [2025-03-15 02:43:03,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 206.5) internal successors, (826), 4 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:43:03,843 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:43:03,843 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:43:03,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-15 02:43:03,843 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:43:03,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:43:03,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2132836391, now seen corresponding path program 1 times [2025-03-15 02:43:03,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:43:03,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386308254] [2025-03-15 02:43:03,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:43:03,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:43:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:43:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:43:03,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:43:03,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386308254] [2025-03-15 02:43:03,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386308254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:43:03,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:43:03,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:43:03,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490356022] [2025-03-15 02:43:03,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:43:03,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:43:03,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:43:03,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:43:03,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:43:03,881 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 229 [2025-03-15 02:43:03,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 1463 transitions, 45730 flow. Second operand has 4 states, 4 states have (on average 206.75) internal successors, (827), 4 states have internal predecessors, (827), 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 02:43:03,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:43:03,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 229 [2025-03-15 02:43:03,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:43:13,198 INFO L124 PetriNetUnfolderBase]: 4579/34652 cut-off events. [2025-03-15 02:43:13,199 INFO L125 PetriNetUnfolderBase]: For 687838/713941 co-relation queries the response was YES. [2025-03-15 02:43:13,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243633 conditions, 34652 events. 4579/34652 cut-off events. For 687838/713941 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 500031 event pairs, 1218 based on Foata normal form. 423/29777 useless extension candidates. Maximal degree in co-relation 115289. Up to 8494 conditions per place. [2025-03-15 02:43:13,724 INFO L140 encePairwiseOnDemand]: 222/229 looper letters, 444 selfloop transitions, 9 changer transitions 90/1470 dead transitions. [2025-03-15 02:43:13,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 533 places, 1470 transitions, 47028 flow [2025-03-15 02:43:13,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:43:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:43:13,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1055 transitions. [2025-03-15 02:43:13,726 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9213973799126638 [2025-03-15 02:43:13,726 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 311 predicate places. [2025-03-15 02:43:13,726 INFO L471 AbstractCegarLoop]: Abstraction has has 533 places, 1470 transitions, 47028 flow [2025-03-15 02:43:13,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 206.75) internal successors, (827), 4 states have internal predecessors, (827), 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 02:43:13,726 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:43:13,726 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:43:13,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-15 02:43:13,727 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:43:13,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:43:13,727 INFO L85 PathProgramCache]: Analyzing trace with hash -324542994, now seen corresponding path program 1 times [2025-03-15 02:43:13,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:43:13,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118663337] [2025-03-15 02:43:13,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:43:13,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:43:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:43:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:43:13,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:43:13,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118663337] [2025-03-15 02:43:13,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118663337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:43:13,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850344618] [2025-03-15 02:43:13,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:43:13,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:43:13,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:43:13,808 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:43:13,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-15 02:43:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:43:13,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-15 02:43:13,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:43:14,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:43:14,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:43:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:43:14,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850344618] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:43:14,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:43:14,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2025-03-15 02:43:14,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033085826] [2025-03-15 02:43:14,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:43:14,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-15 02:43:14,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:43:14,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-15 02:43:14,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2025-03-15 02:43:14,171 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 229 [2025-03-15 02:43:14,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 1470 transitions, 47028 flow. Second operand has 24 states, 24 states have (on average 183.95833333333334) internal successors, (4415), 24 states have internal predecessors, (4415), 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 02:43:14,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:43:14,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 229 [2025-03-15 02:43:14,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:43:22,265 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([587] L57-7-->L58: Formula: (< |v_thread2Thread1of1ForFork1_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][732], [2884#true, 5213#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 5923#true, 133#L73-4true, 779#true, 754#true, 225#true, 3979#true, 2871#(and (= ~A~0.offset 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483648)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 231#true, 4000#true, 5910#(and (= ~A~0.offset 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483648)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 2891#(<= ~N~0 2147483647), 4622#true, thread1Thread1of1ForFork0InUse, 5939#true, 5278#true, thread2Thread1of1ForFork1InUse, 120#L58true, 1279#true, 5226#true, 5236#true, 53#L48-7true, 4612#true, 5257#true, 1798#true, 5933#true, 758#true, 775#true, 4599#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 4004#true, 5945#true, 404#true, 2329#true, 796#true, 3412#true]) [2025-03-15 02:43:22,266 INFO L294 olderBase$Statistics]: this new event has 248 ancestors and is cut-off event [2025-03-15 02:43:22,266 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-03-15 02:43:22,266 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-15 02:43:22,266 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-15 02:43:22,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L57-7-->L57-8: Formula: (<= v_~N~0_3 |v_thread2Thread1of1ForFork1_~i~1#1_3|) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3|, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3|, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][733], [2884#true, 5213#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 5923#true, 133#L73-4true, 779#true, 754#true, 225#true, 3979#true, 2871#(and (= ~A~0.offset 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483648)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 231#true, 4000#true, 5910#(and (= ~A~0.offset 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483648)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 2891#(<= ~N~0 2147483647), 4622#true, thread1Thread1of1ForFork0InUse, 5939#true, 5278#true, thread2Thread1of1ForFork1InUse, 205#L57-8true, 1279#true, 5226#true, 5236#true, 53#L48-7true, 4612#true, 5257#true, 1798#true, 5933#true, 758#true, 4599#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 775#true, 4004#true, 5945#true, 404#true, 2329#true, 796#true, 3412#true]) [2025-03-15 02:43:22,266 INFO L294 olderBase$Statistics]: this new event has 248 ancestors and is cut-off event [2025-03-15 02:43:22,266 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-15 02:43:22,266 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-03-15 02:43:22,266 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-15 02:43:22,266 INFO L124 PetriNetUnfolderBase]: 3718/28237 cut-off events. [2025-03-15 02:43:22,266 INFO L125 PetriNetUnfolderBase]: For 582201/607143 co-relation queries the response was YES. [2025-03-15 02:43:22,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202787 conditions, 28237 events. 3718/28237 cut-off events. For 582201/607143 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 386905 event pairs, 792 based on Foata normal form. 144/24286 useless extension candidates. Maximal degree in co-relation 112143. Up to 8153 conditions per place. [2025-03-15 02:43:22,699 INFO L140 encePairwiseOnDemand]: 209/229 looper letters, 459 selfloop transitions, 32 changer transitions 103/1402 dead transitions. [2025-03-15 02:43:22,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 1402 transitions, 45383 flow [2025-03-15 02:43:22,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-15 02:43:22,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-15 02:43:22,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3714 transitions. [2025-03-15 02:43:22,702 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8109170305676856 [2025-03-15 02:43:22,702 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 326 predicate places. [2025-03-15 02:43:22,702 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 1402 transitions, 45383 flow [2025-03-15 02:43:22,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 183.95833333333334) internal successors, (4415), 24 states have internal predecessors, (4415), 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 02:43:22,703 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:43:22,703 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:43:22,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-15 02:43:22,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:43:22,908 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:43:22,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:43:22,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1117767473, now seen corresponding path program 1 times [2025-03-15 02:43:22,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:43:22,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940949570] [2025-03-15 02:43:22,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:43:22,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:43:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:43:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:43:22,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:43:22,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940949570] [2025-03-15 02:43:22,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940949570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:43:22,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689667184] [2025-03-15 02:43:22,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:43:22,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:43:22,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:43:22,998 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:43:23,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-15 02:43:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:43:23,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-15 02:43:23,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:43:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:43:23,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:43:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:43:23,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689667184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:43:23,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:43:23,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2025-03-15 02:43:23,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28652711] [2025-03-15 02:43:23,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:43:23,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-15 02:43:23,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:43:23,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-15 02:43:23,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2025-03-15 02:43:23,382 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 229 [2025-03-15 02:43:23,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 1402 transitions, 45383 flow. Second operand has 24 states, 24 states have (on average 184.0) internal successors, (4416), 24 states have internal predecessors, (4416), 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 02:43:23,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:43:23,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 229 [2025-03-15 02:43:23,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:43:29,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([518] L48-7-->L48-8: Formula: (<= v_~N~0_2 |v_thread1Thread1of1ForFork0_~i~0#1_3|) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_3|, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_3|, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][688], [2884#true, 5213#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 5923#true, 210#L57-7true, 133#L73-4true, 779#true, 754#true, 3979#true, 225#true, 2871#(and (= ~A~0.offset 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483648)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 231#true, 5955#(<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|), 180#L48-8true, 4000#true, 5910#(and (= ~A~0.offset 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483648)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 2891#(<= ~N~0 2147483647), thread1Thread1of1ForFork0InUse, 4622#true, 5939#true, thread2Thread1of1ForFork1InUse, 5278#true, 1279#true, 6673#true, 5226#true, 5236#true, 4612#true, 5257#true, 1798#true, 5933#true, 4599#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 758#true, 775#true, 4004#true, 404#true, 2329#true, 796#true, 3412#true]) [2025-03-15 02:43:29,085 INFO L294 olderBase$Statistics]: this new event has 248 ancestors and is cut-off event [2025-03-15 02:43:29,085 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-15 02:43:29,085 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-15 02:43:29,085 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-03-15 02:43:29,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([519] L48-7-->L49: Formula: (< |v_thread1Thread1of1ForFork0_~i~0#1_5| v_~N~0_1) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][689], [2884#true, 154#L49true, 5213#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 5923#true, 210#L57-7true, 133#L73-4true, 779#true, 754#true, 3979#true, 225#true, 2871#(and (= ~A~0.offset 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483648)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 231#true, 4000#true, 5910#(and (= ~A~0.offset 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483648)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 2891#(<= ~N~0 2147483647), thread1Thread1of1ForFork0InUse, 4622#true, 5939#true, thread2Thread1of1ForFork1InUse, 5278#true, 1279#true, 6673#true, 5226#true, 5236#true, 4612#true, 5257#true, 1798#true, 5933#true, 758#true, 4599#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 775#true, 5945#true, 4004#true, 404#true, 2329#true, 796#true, 3412#true]) [2025-03-15 02:43:29,085 INFO L294 olderBase$Statistics]: this new event has 248 ancestors and is cut-off event [2025-03-15 02:43:29,085 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-15 02:43:29,085 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-15 02:43:29,085 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-03-15 02:43:29,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([587] L57-7-->L58: Formula: (< |v_thread2Thread1of1ForFork1_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][741], [2884#true, 5213#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 5923#true, 133#L73-4true, 779#true, 754#true, 3979#true, 225#true, 2871#(and (= ~A~0.offset 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483648)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 231#true, 4000#true, 5910#(and (= ~A~0.offset 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483648)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 2891#(<= ~N~0 2147483647), thread1Thread1of1ForFork0InUse, 4622#true, 5939#true, thread2Thread1of1ForFork1InUse, 5278#true, 120#L58true, 1279#true, 6673#true, 5226#true, 5236#true, 53#L48-7true, 4612#true, 5257#true, 1798#true, 5933#true, 4599#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 758#true, 775#true, 5945#true, 4004#true, 404#true, 2329#true, 796#true, 3412#true]) [2025-03-15 02:43:29,085 INFO L294 olderBase$Statistics]: this new event has 248 ancestors and is cut-off event [2025-03-15 02:43:29,085 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-03-15 02:43:29,085 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-15 02:43:29,086 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-15 02:43:29,086 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L57-7-->L57-8: Formula: (<= v_~N~0_3 |v_thread2Thread1of1ForFork1_~i~1#1_3|) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3|, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3|, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][742], [2884#true, 5213#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 5923#true, 133#L73-4true, 779#true, 754#true, 3979#true, 225#true, 2871#(and (= ~A~0.offset 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483648)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 231#true, 6683#(<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|), 4000#true, 5910#(and (= ~A~0.offset 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483648)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 2891#(<= ~N~0 2147483647), thread1Thread1of1ForFork0InUse, 4622#true, 5939#true, thread2Thread1of1ForFork1InUse, 5278#true, 1279#true, 205#L57-8true, 5226#true, 5236#true, 53#L48-7true, 4612#true, 5257#true, 1798#true, 5933#true, 4599#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 775#true, 758#true, 4004#true, 5945#true, 404#true, 2329#true, 796#true, 3412#true]) [2025-03-15 02:43:29,086 INFO L294 olderBase$Statistics]: this new event has 248 ancestors and is cut-off event [2025-03-15 02:43:29,086 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-03-15 02:43:29,086 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-15 02:43:29,086 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2025-03-15 02:43:29,086 INFO L124 PetriNetUnfolderBase]: 3104/21558 cut-off events. [2025-03-15 02:43:29,086 INFO L125 PetriNetUnfolderBase]: For 541332/571238 co-relation queries the response was YES. [2025-03-15 02:43:29,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161157 conditions, 21558 events. 3104/21558 cut-off events. For 541332/571238 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 275058 event pairs, 638 based on Foata normal form. 396/18928 useless extension candidates. Maximal degree in co-relation 113984. Up to 5491 conditions per place. [2025-03-15 02:43:29,473 INFO L140 encePairwiseOnDemand]: 209/229 looper letters, 367 selfloop transitions, 33 changer transitions 180/1337 dead transitions. [2025-03-15 02:43:29,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 1337 transitions, 43876 flow [2025-03-15 02:43:29,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-15 02:43:29,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-15 02:43:29,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3714 transitions. [2025-03-15 02:43:29,475 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8109170305676856 [2025-03-15 02:43:29,475 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 341 predicate places. [2025-03-15 02:43:29,476 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 1337 transitions, 43876 flow [2025-03-15 02:43:29,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 184.0) internal successors, (4416), 24 states have internal predecessors, (4416), 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 02:43:29,476 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:43:29,476 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:43:29,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-15 02:43:29,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-15 02:43:29,677 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:43:29,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:43:29,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1892793388, now seen corresponding path program 2 times [2025-03-15 02:43:29,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:43:29,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483782534] [2025-03-15 02:43:29,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:43:29,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:43:29,687 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:43:29,687 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:43:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:43:30,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:43:30,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483782534] [2025-03-15 02:43:30,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483782534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:43:30,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371236052] [2025-03-15 02:43:30,157 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:43:30,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:43:30,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:43:30,159 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:43:30,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-15 02:43:30,396 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:43:30,396 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:43:30,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-15 02:43:30,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:43:30,501 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 1 [2025-03-15 02:43:30,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-15 02:43:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:43:30,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:43:31,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-15 02:43:31,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-15 02:43:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:43:31,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371236052] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:43:31,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:43:31,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 15] total 50 [2025-03-15 02:43:31,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635498345] [2025-03-15 02:43:31,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:43:31,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-15 02:43:31,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:43:31,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-15 02:43:31,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2383, Unknown=0, NotChecked=0, Total=2550 [2025-03-15 02:43:31,124 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 229 [2025-03-15 02:43:31,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 1337 transitions, 43876 flow. Second operand has 51 states, 51 states have (on average 145.7843137254902) internal successors, (7435), 51 states have internal predecessors, (7435), 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 02:43:31,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:43:31,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 229 [2025-03-15 02:43:31,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:43:51,591 INFO L124 PetriNetUnfolderBase]: 7711/54566 cut-off events. [2025-03-15 02:43:51,592 INFO L125 PetriNetUnfolderBase]: For 1320153/1396434 co-relation queries the response was YES. [2025-03-15 02:43:52,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413564 conditions, 54566 events. 7711/54566 cut-off events. For 1320153/1396434 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 784078 event pairs, 1804 based on Foata normal form. 849/46977 useless extension candidates. Maximal degree in co-relation 212445. Up to 14216 conditions per place. [2025-03-15 02:43:52,568 INFO L140 encePairwiseOnDemand]: 193/229 looper letters, 1167 selfloop transitions, 132 changer transitions 253/2004 dead transitions. [2025-03-15 02:43:52,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 2004 transitions, 74021 flow [2025-03-15 02:43:52,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-15 02:43:52,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-03-15 02:43:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 8914 transitions. [2025-03-15 02:43:52,573 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6487627365356623 [2025-03-15 02:43:52,573 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 400 predicate places. [2025-03-15 02:43:52,573 INFO L471 AbstractCegarLoop]: Abstraction has has 622 places, 2004 transitions, 74021 flow [2025-03-15 02:43:52,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 145.7843137254902) internal successors, (7435), 51 states have internal predecessors, (7435), 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 02:43:52,574 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:43:52,574 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:43:52,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-15 02:43:52,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:43:52,775 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:43:52,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:43:52,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1154646289, now seen corresponding path program 2 times [2025-03-15 02:43:52,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:43:52,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572563070] [2025-03-15 02:43:52,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:43:52,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:43:52,786 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:43:52,791 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:43:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:43:53,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:43:53,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572563070] [2025-03-15 02:43:53,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572563070] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:43:53,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928547940] [2025-03-15 02:43:53,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:43:53,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:43:53,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:43:53,253 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:43:53,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-15 02:43:53,307 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:43:53,307 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:43:53,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-15 02:43:53,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:43:53,368 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 19 treesize of output 1 [2025-03-15 02:43:53,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-15 02:43:53,605 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:43:53,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:43:53,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-15 02:43:53,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-03-15 02:43:53,871 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:43:53,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928547940] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:43:53,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:43:53,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15, 15] total 45 [2025-03-15 02:43:53,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128167910] [2025-03-15 02:43:53,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:43:53,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-15 02:43:53,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:43:53,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-15 02:43:53,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1936, Unknown=0, NotChecked=0, Total=2070 [2025-03-15 02:43:53,874 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 229 [2025-03-15 02:43:53,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 2004 transitions, 74021 flow. Second operand has 46 states, 46 states have (on average 145.91304347826087) internal successors, (6712), 46 states have internal predecessors, (6712), 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 02:43:53,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:43:53,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 229 [2025-03-15 02:43:53,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:44:26,701 INFO L124 PetriNetUnfolderBase]: 10469/73660 cut-off events. [2025-03-15 02:44:26,702 INFO L125 PetriNetUnfolderBase]: For 1474044/1511309 co-relation queries the response was YES. [2025-03-15 02:44:27,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566743 conditions, 73660 events. 10469/73660 cut-off events. For 1474044/1511309 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 1079476 event pairs, 2737 based on Foata normal form. 1311/63211 useless extension candidates. Maximal degree in co-relation 360587. Up to 17552 conditions per place. [2025-03-15 02:44:28,099 INFO L140 encePairwiseOnDemand]: 193/229 looper letters, 1322 selfloop transitions, 161 changer transitions 277/2437 dead transitions. [2025-03-15 02:44:28,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 681 places, 2437 transitions, 89449 flow [2025-03-15 02:44:28,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-15 02:44:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-03-15 02:44:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 8914 transitions. [2025-03-15 02:44:28,103 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6487627365356623 [2025-03-15 02:44:28,103 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 459 predicate places. [2025-03-15 02:44:28,103 INFO L471 AbstractCegarLoop]: Abstraction has has 681 places, 2437 transitions, 89449 flow [2025-03-15 02:44:28,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 145.91304347826087) internal successors, (6712), 46 states have internal predecessors, (6712), 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 02:44:28,104 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:44:28,104 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:44:28,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-15 02:44:28,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:44:28,305 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:44:28,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:44:28,305 INFO L85 PathProgramCache]: Analyzing trace with hash 663186722, now seen corresponding path program 1 times [2025-03-15 02:44:28,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:44:28,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590758948] [2025-03-15 02:44:28,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:44:28,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:44:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:44:28,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:44:28,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:44:28,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590758948] [2025-03-15 02:44:28,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590758948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:44:28,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:44:28,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-15 02:44:28,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136663534] [2025-03-15 02:44:28,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:44:28,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 02:44:28,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:44:28,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 02:44:28,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-15 02:44:28,446 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 229 [2025-03-15 02:44:28,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 2437 transitions, 89449 flow. Second operand has 15 states, 15 states have (on average 155.2) internal successors, (2328), 15 states have internal predecessors, (2328), 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 02:44:28,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:44:28,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 229 [2025-03-15 02:44:28,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:46:29,767 INFO L124 PetriNetUnfolderBase]: 73757/231638 cut-off events. [2025-03-15 02:46:29,768 INFO L125 PetriNetUnfolderBase]: For 6794062/6983967 co-relation queries the response was YES. [2025-03-15 02:46:32,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2052431 conditions, 231638 events. 73757/231638 cut-off events. For 6794062/6983967 co-relation queries the response was YES. Maximal size of possible extension queue 1990. Compared 3234217 event pairs, 19210 based on Foata normal form. 902/198349 useless extension candidates. Maximal degree in co-relation 1246425. Up to 55203 conditions per place. [2025-03-15 02:46:34,953 INFO L140 encePairwiseOnDemand]: 203/229 looper letters, 5893 selfloop transitions, 966 changer transitions 705/8359 dead transitions. [2025-03-15 02:46:34,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 797 places, 8359 transitions, 286058 flow [2025-03-15 02:46:34,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2025-03-15 02:46:34,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2025-03-15 02:46:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 19570 transitions. [2025-03-15 02:46:34,963 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.730414660545665 [2025-03-15 02:46:34,964 INFO L298 CegarLoopForPetriNet]: 222 programPoint places, 575 predicate places. [2025-03-15 02:46:34,964 INFO L471 AbstractCegarLoop]: Abstraction has has 797 places, 8359 transitions, 286058 flow [2025-03-15 02:46:34,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 155.2) internal successors, (2328), 15 states have internal predecessors, (2328), 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 02:46:34,964 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:46:34,964 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:46:34,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-15 02:46:34,964 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-03-15 02:46:34,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:46:34,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1273926742, now seen corresponding path program 1 times [2025-03-15 02:46:34,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:46:34,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792887760] [2025-03-15 02:46:34,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:46:34,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:46:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:46:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:46:35,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:46:35,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792887760] [2025-03-15 02:46:35,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792887760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:46:35,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:46:35,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-15 02:46:35,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046089903] [2025-03-15 02:46:35,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:46:35,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 02:46:35,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:46:35,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 02:46:35,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-15 02:46:35,093 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 229 [2025-03-15 02:46:35,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 797 places, 8359 transitions, 286058 flow. Second operand has 15 states, 15 states have (on average 155.2) internal successors, (2328), 15 states have internal predecessors, (2328), 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 02:46:35,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:46:35,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 229 [2025-03-15 02:46:35,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:53:18,255 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L57-7-->L57-8: Formula: (<= v_~N~0_3 |v_thread2Thread1of1ForFork1_~i~1#1_3|) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3|, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3|, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][2967], [2884#true, 5213#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 5923#true, 133#L73-4true, 754#true, 779#true, 225#true, 3979#true, 9499#true, 2871#(and (= ~A~0.offset 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483648)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 231#true, 6683#(<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|), 4000#true, 5910#(and (= ~A~0.offset 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483648)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 2891#(<= ~N~0 2147483647), 4622#true, thread1Thread1of1ForFork0InUse, 5939#true, 5278#true, thread2Thread1of1ForFork1InUse, 1279#true, 205#L57-8true, 5226#true, 53#L48-7true, 5236#true, 5257#true, 4612#true, 1798#true, 9268#true, 5933#true, 8337#true, 758#true, 775#true, 4599#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 5945#true, 4004#true, 404#true, 7437#true, 2329#true, 796#true, 3412#true]) [2025-03-15 02:53:18,256 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2025-03-15 02:53:18,256 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2025-03-15 02:53:18,256 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-03-15 02:53:18,256 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-15 02:53:18,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([587] L57-7-->L58: Formula: (< |v_thread2Thread1of1ForFork1_~i~1#1_5| v_~N~0_4) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_5|, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_5|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][2968], [2884#true, 5213#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 5923#true, 133#L73-4true, 779#true, 754#true, 225#true, 3979#true, 9499#true, 2871#(and (= ~A~0.offset 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483648)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 231#true, 4000#true, 5910#(and (= ~A~0.offset 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483648)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 2891#(<= ~N~0 2147483647), 4622#true, thread1Thread1of1ForFork0InUse, 5939#true, 5278#true, thread2Thread1of1ForFork1InUse, 120#L58true, 1279#true, 6673#true, 5226#true, 53#L48-7true, 5236#true, 5257#true, 4612#true, 1798#true, 9268#true, 5933#true, 8337#true, 758#true, 4599#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 775#true, 5945#true, 4004#true, 404#true, 7437#true, 2329#true, 796#true, 3412#true]) [2025-03-15 02:53:18,256 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2025-03-15 02:53:18,256 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-15 02:53:18,256 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2025-03-15 02:53:18,256 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-03-15 02:53:18,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([519] L48-7-->L49: Formula: (< |v_thread1Thread1of1ForFork0_~i~0#1_5| v_~N~0_1) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][2413], [2884#true, 5213#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 154#L49true, 5923#true, 210#L57-7true, 133#L73-4true, 754#true, 779#true, 225#true, 3979#true, 9499#true, 2871#(and (= ~A~0.offset 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483648)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 231#true, 4000#true, 5910#(and (= ~A~0.offset 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483648)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 2891#(<= ~N~0 2147483647), 4622#true, thread1Thread1of1ForFork0InUse, 5939#true, 5278#true, thread2Thread1of1ForFork1InUse, 1279#true, 6673#true, 5226#true, 5236#true, 5257#true, 4612#true, 1798#true, 9268#true, 5933#true, 8337#true, 758#true, 775#true, 4599#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 5945#true, 4004#true, 404#true, 7437#true, 2329#true, 796#true, 3412#true]) [2025-03-15 02:53:18,256 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2025-03-15 02:53:18,256 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-15 02:53:18,256 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2025-03-15 02:53:18,256 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-03-15 02:53:18,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([518] L48-7-->L48-8: Formula: (<= v_~N~0_2 |v_thread1Thread1of1ForFork0_~i~0#1_3|) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_3|, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_3|, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][2414], [2884#true, 5213#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 5923#true, 210#L57-7true, 133#L73-4true, 754#true, 779#true, 225#true, 3979#true, 9499#true, 2871#(and (= ~A~0.offset 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483648)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 231#true, 5955#(<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|), 4000#true, 180#L48-8true, 5910#(and (= ~A~0.offset 0) (<= 0 (+ 2147483648 (select (select |#memory_int| ~A~0.base) 0))) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483648)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 2891#(<= ~N~0 2147483647), 4622#true, thread1Thread1of1ForFork0InUse, 5939#true, 5278#true, thread2Thread1of1ForFork1InUse, 1279#true, 6673#true, 5226#true, 5236#true, 5257#true, 4612#true, 1798#true, 9268#true, 5933#true, 8337#true, 758#true, 775#true, 4599#(and (= ~A~0.offset 0) (<= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 0) 2147483647) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (<= (select (select |#memory_int| ~A~0.base) 0) 2147483647)), 4004#true, 404#true, 7437#true, 2329#true, 796#true, 3412#true]) [2025-03-15 02:53:18,256 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2025-03-15 02:53:18,256 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-15 02:53:18,256 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2025-03-15 02:53:18,256 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event