/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 -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-split-sample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:53:58,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:53:58,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:53:58,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:53:58,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:53:58,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:53:58,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:53:58,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:53:58,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:53:58,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:53:58,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:53:58,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:53:58,119 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:53:58,119 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:53:58,120 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:53:58,120 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:53:58,120 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:53:58,120 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:53:58,120 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:53:58,120 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:53:58,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:53:58,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:53:58,120 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:53:58,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:53:58,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:53:58,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:53:58,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:53:58,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:53:58,120 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:53:58,120 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:53:58,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:53:58,121 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:53:58,121 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:53:58,121 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:53:58,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:53:58,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:58,121 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:53:58,121 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:53:58,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:53:58,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:53:58,121 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:53:58,121 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:53:58,122 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:53:58,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:53:58,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:53:58,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:53:58,366 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:53:58,367 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:53:58,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-split-sample.bpl [2025-04-26 16:53:58,368 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-split-sample.bpl' [2025-04-26 16:53:58,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:53:58,387 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:53:58,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:58,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:53:58,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:53:58,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,413 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:53:58,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:58,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:53:58,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:53:58,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:53:58,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,423 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:53:58,439 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:53:58,439 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:53:58,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:53:58,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/1) ... [2025-04-26 16:53:58,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:58,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,463 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:53:58,485 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin2 given in one single declaration [2025-04-26 16:53:58,485 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin2 [2025-04-26 16:53:58,485 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin2 [2025-04-26 16:53:58,485 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:53:58,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:53:58,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:53:58,485 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin1 given in one single declaration [2025-04-26 16:53:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin1 [2025-04-26 16:53:58,486 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin1 [2025-04-26 16:53:58,486 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax2 given in one single declaration [2025-04-26 16:53:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax2 [2025-04-26 16:53:58,486 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax2 [2025-04-26 16:53:58,486 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax1 given in one single declaration [2025-04-26 16:53:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax1 [2025-04-26 16:53:58,486 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax1 [2025-04-26 16:53:58,486 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2025-04-26 16:53:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2025-04-26 16:53:58,486 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2025-04-26 16:53:58,487 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:53:58,532 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:53:58,534 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:53:58,650 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:53:58,650 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:53:58,667 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:53:58,668 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-26 16:53:58,668 INFO L201 PluginConnector]: Adding new model min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:58 BoogieIcfgContainer [2025-04-26 16:53:58,668 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:53:58,669 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:53:58,669 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:53:58,673 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:53:58,673 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:58,674 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:58" (1/2) ... [2025-04-26 16:53:58,675 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@692bbd4a and model type min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:53:58, skipping insertion in model container [2025-04-26 16:53:58,675 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:58,675 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:58" (2/2) ... [2025-04-26 16:53:58,676 INFO L376 chiAutomizerObserver]: Analyzing ICFG min-max-split-sample.bpl [2025-04-26 16:53:58,719 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:53:58,750 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:53:58,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:53:58,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:53:58,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 132 flow [2025-04-26 16:53:58,831 INFO L116 PetriNetUnfolderBase]: 5/40 cut-off events. [2025-04-26 16:53:58,833 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:53:58,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 40 events. 5/40 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 88 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-04-26 16:53:58,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 50 transitions, 132 flow [2025-04-26 16:53:58,840 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 40 transitions, 107 flow [2025-04-26 16:53:58,840 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 51 places, 40 transitions, 107 flow [2025-04-26 16:53:58,848 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:53:59,526 WARN L140 AmpleReduction]: Number of pruned transitions: 5483 [2025-04-26 16:53:59,527 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:53:59,527 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 465 [2025-04-26 16:53:59,527 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:147 [2025-04-26 16:53:59,528 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:1859 [2025-04-26 16:53:59,528 WARN L145 AmpleReduction]: Times succ was already a loop node:1105 [2025-04-26 16:53:59,528 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:146 [2025-04-26 16:53:59,528 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:53:59,539 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 2472 states, 2470 states have (on average 2.1672064777327935) internal successors, (in total 5353), 2471 states have internal predecessors, (5353), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:59,548 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:53:59,548 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:53:59,548 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:53:59,548 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:53:59,548 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:53:59,548 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:53:59,548 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:53:59,548 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:53:59,555 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2472 states, 2470 states have (on average 2.1672064777327935) internal successors, (in total 5353), 2471 states have internal predecessors, (5353), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:59,619 INFO L131 ngComponentsAnalysis]: Automaton has 321 accepting balls. 1455 [2025-04-26 16:53:59,620 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:59,620 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:59,625 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:53:59,626 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:53:59,626 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:53:59,631 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2472 states, 2470 states have (on average 2.1672064777327935) internal successors, (in total 5353), 2471 states have internal predecessors, (5353), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:59,659 INFO L131 ngComponentsAnalysis]: Automaton has 321 accepting balls. 1455 [2025-04-26 16:53:59,659 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:59,659 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:59,659 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:53:59,659 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:53:59,665 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (<= 0 v_k_2) (<= v_k_2 v_N_3)) InVars {k=v_k_2, N=v_N_3} OutVars{k=v_k_2, N=v_N_3} AuxVars[] AssignedVars[]" "[72] L97-->L98: Formula: (= (select v_A_2 0) v_array_min_3) InVars {A=v_A_2} OutVars{A=v_A_2, array_min=v_array_min_3} AuxVars[] AssignedVars[array_min]" "[67] L98-->L100: Formula: (= v_array_max_1 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max]" "[140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0]" "[112] $Ultimate##0-->L36-1: Formula: (= v_i1_2 0) InVars {} OutVars{i1=v_i1_2} AuxVars[] AssignedVars[i1]" [2025-04-26 16:53:59,665 INFO L754 eck$LassoCheckResult]: Loop: "[114] L36-1-->L36: Formula: (< v_i1_3 v_k_4) InVars {i1=v_i1_3, k=v_k_4} OutVars{i1=v_i1_3, k=v_k_4} AuxVars[] AssignedVars[]" "[116] L36-->L36-1: Formula: (and (= (let ((.cse0 (select v_A_9 v_i1_9))) (ite (< v_array_min_15 .cse0) v_array_min_15 .cse0)) v_array_min_14) (= (+ v_i1_9 1) v_i1_8)) InVars {A=v_A_9, i1=v_i1_9, array_min=v_array_min_15} OutVars{A=v_A_9, i1=v_i1_8, array_min=v_array_min_14} AuxVars[] AssignedVars[array_min, i1]" [2025-04-26 16:53:59,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:59,671 INFO L85 PathProgramCache]: Analyzing trace with hash 127812647, now seen corresponding path program 1 times [2025-04-26 16:53:59,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:59,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797033055] [2025-04-26 16:53:59,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:59,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:59,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:53:59,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:53:59,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:59,733 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:59,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:53:59,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:53:59,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:59,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:59,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:59,757 INFO L85 PathProgramCache]: Analyzing trace with hash 4611, now seen corresponding path program 1 times [2025-04-26 16:53:59,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:59,757 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744185616] [2025-04-26 16:53:59,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:59,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:59,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:59,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:59,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:59,793 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:59,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:59,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:59,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:59,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:59,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:59,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1726094167, now seen corresponding path program 1 times [2025-04-26 16:53:59,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:59,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845233724] [2025-04-26 16:53:59,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:59,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:59,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:53:59,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:53:59,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:59,826 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:59,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:53:59,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:53:59,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:59,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:59,959 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:59,960 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:59,960 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:59,960 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:59,960 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:59,960 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:59,961 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:59,961 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:59,961 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:53:59,961 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:59,961 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:59,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:00,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:00,150 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:00,152 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:00,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:00,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:00,155 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:00,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:54:00,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:00,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:00,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:00,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:00,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:00,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:00,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:00,183 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:00,191 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:54:00,191 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:54:00,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:00,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:00,194 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:00,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:54:00,197 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:00,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:00,214 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:00,215 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:00,215 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, k) = -1*i1 + 1*k Supporting invariants [] [2025-04-26 16:54:00,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:54:00,223 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:00,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:00,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:00,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:00,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:00,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:00,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:00,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:00,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:00,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:00,268 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:00,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:00,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:00,301 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:54:00,306 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 2472 states, 2470 states have (on average 2.1672064777327935) internal successors, (in total 5353), 2471 states have internal predecessors, (5353), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:00,472 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 2472 states, 2470 states have (on average 2.1672064777327935) internal successors, (in total 5353), 2471 states have internal predecessors, (5353), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 5068 states and 12047 transitions. Complement of second has 6 states. [2025-04-26 16:54:00,473 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-04-26 16:54:00,479 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:54:00,480 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:00,480 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:54:00,480 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:00,480 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:54:00,480 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:00,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5068 states and 12047 transitions. [2025-04-26 16:54:00,522 INFO L131 ngComponentsAnalysis]: Automaton has 281 accepting balls. 1138 [2025-04-26 16:54:00,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5068 states to 3676 states and 8671 transitions. [2025-04-26 16:54:00,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2251 [2025-04-26 16:54:00,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2765 [2025-04-26 16:54:00,573 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3676 states and 8671 transitions. [2025-04-26 16:54:00,573 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:00,573 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3676 states and 8671 transitions. [2025-04-26 16:54:00,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states and 8671 transitions. [2025-04-26 16:54:00,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3301. [2025-04-26 16:54:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3301 states, 3301 states have (on average 2.340805816419267) internal successors, (in total 7727), 3300 states have internal predecessors, (7727), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:00,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3301 states to 3301 states and 7727 transitions. [2025-04-26 16:54:00,739 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3301 states and 7727 transitions. [2025-04-26 16:54:00,739 INFO L438 stractBuchiCegarLoop]: Abstraction has 3301 states and 7727 transitions. [2025-04-26 16:54:00,739 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:54:00,739 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3301 states and 7727 transitions. [2025-04-26 16:54:00,752 INFO L131 ngComponentsAnalysis]: Automaton has 281 accepting balls. 1138 [2025-04-26 16:54:00,752 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:00,752 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:00,753 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:54:00,753 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:00,753 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (<= 0 v_k_2) (<= v_k_2 v_N_3)) InVars {k=v_k_2, N=v_N_3} OutVars{k=v_k_2, N=v_N_3} AuxVars[] AssignedVars[]" "[72] L97-->L98: Formula: (= (select v_A_2 0) v_array_min_3) InVars {A=v_A_2} OutVars{A=v_A_2, array_min=v_array_min_3} AuxVars[] AssignedVars[array_min]" "[67] L98-->L100: Formula: (= v_array_max_1 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max]" "[140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0]" "[143] L100-1-->$Ultimate##0: Formula: (and (= 2 v_computeMin2Thread1of1ForFork3_thidvar0_2) (= 2 v_computeMin2Thread1of1ForFork3_thidvar1_2)) InVars {} OutVars{computeMin2Thread1of1ForFork3_thidvar0=v_computeMin2Thread1of1ForFork3_thidvar0_2, computeMin2Thread1of1ForFork3_thidvar1=v_computeMin2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[computeMin2Thread1of1ForFork3_thidvar0, computeMin2Thread1of1ForFork3_thidvar1]" "[107] $Ultimate##0-->L48-1: Formula: (= v_i2_1 (+ v_k_1 1)) InVars {k=v_k_1} OutVars{i2=v_i2_1, k=v_k_1} AuxVars[] AssignedVars[i2]" [2025-04-26 16:54:00,753 INFO L754 eck$LassoCheckResult]: Loop: "[109] L48-1-->L48: Formula: (< v_i2_2 v_N_1) InVars {i2=v_i2_2, N=v_N_1} OutVars{i2=v_i2_2, N=v_N_1} AuxVars[] AssignedVars[]" "[111] L48-->L48-1: Formula: (and (= v_i2_8 (+ v_i2_9 1)) (= (let ((.cse0 (select v_A_7 v_i2_9))) (ite (< v_array_min_11 .cse0) v_array_min_11 .cse0)) v_array_min_10)) InVars {A=v_A_7, i2=v_i2_9, array_min=v_array_min_11} OutVars{A=v_A_7, i2=v_i2_8, array_min=v_array_min_10} AuxVars[] AssignedVars[array_min, i2]" [2025-04-26 16:54:00,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:00,754 INFO L85 PathProgramCache]: Analyzing trace with hash -332774171, now seen corresponding path program 1 times [2025-04-26 16:54:00,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:00,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171044596] [2025-04-26 16:54:00,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:00,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:00,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:00,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:00,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:00,759 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:00,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:00,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:00,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:00,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:00,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:00,766 INFO L85 PathProgramCache]: Analyzing trace with hash 4451, now seen corresponding path program 1 times [2025-04-26 16:54:00,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:00,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867555674] [2025-04-26 16:54:00,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:00,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:00,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:00,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:00,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:00,773 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:00,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:00,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:00,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:00,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:00,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:00,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1968394937, now seen corresponding path program 1 times [2025-04-26 16:54:00,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:00,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790937462] [2025-04-26 16:54:00,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:00,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:00,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:00,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:00,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:00,784 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:00,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:00,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:00,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:00,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:00,876 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:00,876 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:00,876 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:00,876 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:00,876 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:00,876 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:00,876 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:00,876 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:00,876 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:54:00,876 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:00,876 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:00,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:00,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:00,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:00,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,016 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:01,016 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:01,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:01,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:01,018 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:01,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:54:01,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:01,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:01,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:01,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:01,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:01,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:01,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:01,040 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:01,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:01,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:01,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:01,048 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:01,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:54:01,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:01,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:01,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:01,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:01,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:01,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:01,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:01,071 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:01,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:54:01,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:01,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:01,080 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:01,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:54:01,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:01,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:01,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:01,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:01,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:01,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:01,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:01,112 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:01,121 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:54:01,121 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:54:01,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:01,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:01,124 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:01,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:54:01,126 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:01,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:54:01,144 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:01,144 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:01,144 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2025-04-26 16:54:01,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:01,151 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:01,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:01,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:01,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:01,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:01,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:01,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:01,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:01,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:01,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:01,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:01,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:01,182 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:01,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:01,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:01,202 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:54:01,202 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3301 states and 7727 transitions. cyclomatic complexity: 4804 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:01,328 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3301 states and 7727 transitions. cyclomatic complexity: 4804. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 7712 states and 19425 transitions. Complement of second has 6 states. [2025-04-26 16:54:01,328 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-04-26 16:54:01,329 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 108 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:54:01,329 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:01,329 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 108 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:54:01,329 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:01,329 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 108 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:54:01,329 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:01,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7712 states and 19425 transitions. [2025-04-26 16:54:01,427 INFO L131 ngComponentsAnalysis]: Automaton has 233 accepting balls. 840 [2025-04-26 16:54:01,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7712 states to 5523 states and 13871 transitions. [2025-04-26 16:54:01,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2369 [2025-04-26 16:54:01,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2852 [2025-04-26 16:54:01,490 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5523 states and 13871 transitions. [2025-04-26 16:54:01,490 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:01,490 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5523 states and 13871 transitions. [2025-04-26 16:54:01,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5523 states and 13871 transitions. [2025-04-26 16:54:01,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5523 to 4915. [2025-04-26 16:54:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4915 states, 4915 states have (on average 2.4942014242115973) internal successors, (in total 12259), 4914 states have internal predecessors, (12259), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4915 states to 4915 states and 12259 transitions. [2025-04-26 16:54:01,634 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4915 states and 12259 transitions. [2025-04-26 16:54:01,635 INFO L438 stractBuchiCegarLoop]: Abstraction has 4915 states and 12259 transitions. [2025-04-26 16:54:01,635 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:54:01,635 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4915 states and 12259 transitions. [2025-04-26 16:54:01,693 INFO L131 ngComponentsAnalysis]: Automaton has 233 accepting balls. 840 [2025-04-26 16:54:01,694 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:01,694 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:01,694 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:01,695 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:01,695 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (<= 0 v_k_2) (<= v_k_2 v_N_3)) InVars {k=v_k_2, N=v_N_3} OutVars{k=v_k_2, N=v_N_3} AuxVars[] AssignedVars[]" "[72] L97-->L98: Formula: (= (select v_A_2 0) v_array_min_3) InVars {A=v_A_2} OutVars{A=v_A_2, array_min=v_array_min_3} AuxVars[] AssignedVars[array_min]" "[67] L98-->L100: Formula: (= v_array_max_1 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max]" "[140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0]" "[143] L100-1-->$Ultimate##0: Formula: (and (= 2 v_computeMin2Thread1of1ForFork3_thidvar0_2) (= 2 v_computeMin2Thread1of1ForFork3_thidvar1_2)) InVars {} OutVars{computeMin2Thread1of1ForFork3_thidvar0=v_computeMin2Thread1of1ForFork3_thidvar0_2, computeMin2Thread1of1ForFork3_thidvar1=v_computeMin2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[computeMin2Thread1of1ForFork3_thidvar0, computeMin2Thread1of1ForFork3_thidvar1]" "[146] L101-->$Ultimate##0: Formula: (and (= v_computeMax1Thread1of1ForFork4_thidvar2_2 3) (= v_computeMax1Thread1of1ForFork4_thidvar0_2 3) (= v_computeMax1Thread1of1ForFork4_thidvar1_2 3)) InVars {} OutVars{computeMax1Thread1of1ForFork4_thidvar0=v_computeMax1Thread1of1ForFork4_thidvar0_2, computeMax1Thread1of1ForFork4_thidvar1=v_computeMax1Thread1of1ForFork4_thidvar1_2, computeMax1Thread1of1ForFork4_thidvar2=v_computeMax1Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[computeMax1Thread1of1ForFork4_thidvar0, computeMax1Thread1of1ForFork4_thidvar1, computeMax1Thread1of1ForFork4_thidvar2]" "[122] $Ultimate##0-->L61-1: Formula: (= v_i3_6 0) InVars {} OutVars{i3=v_i3_6} AuxVars[] AssignedVars[i3]" [2025-04-26 16:54:01,695 INFO L754 eck$LassoCheckResult]: Loop: "[124] L61-1-->L61: Formula: (< v_i3_1 v_k_6) InVars {i3=v_i3_1, k=v_k_6} OutVars{i3=v_i3_1, k=v_k_6} AuxVars[] AssignedVars[]" "[126] L61-->L61-1: Formula: (and (= v_i3_8 (+ v_i3_9 1)) (= (let ((.cse0 (select v_A_13 v_i3_9))) (ite (< v_array_max_15 .cse0) .cse0 v_array_max_15)) v_array_max_14)) InVars {A=v_A_13, array_max=v_array_max_15, i3=v_i3_9} OutVars{A=v_A_13, array_max=v_array_max_14, i3=v_i3_8} AuxVars[] AssignedVars[array_max, i3]" [2025-04-26 16:54:01,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:01,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1726063378, now seen corresponding path program 1 times [2025-04-26 16:54:01,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:01,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885279957] [2025-04-26 16:54:01,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:01,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:01,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:01,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:01,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:01,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:01,707 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:01,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:01,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:01,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:01,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:01,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:01,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:01,714 INFO L85 PathProgramCache]: Analyzing trace with hash 4931, now seen corresponding path program 1 times [2025-04-26 16:54:01,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:01,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830429099] [2025-04-26 16:54:01,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:01,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:01,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:01,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:01,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:01,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:01,718 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:01,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:01,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:01,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:01,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:01,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:01,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:01,722 INFO L85 PathProgramCache]: Analyzing trace with hash -889526032, now seen corresponding path program 1 times [2025-04-26 16:54:01,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:01,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675447928] [2025-04-26 16:54:01,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:01,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:01,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:01,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:01,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:01,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:01,730 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:01,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:01,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:01,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:01,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:01,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:01,877 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:01,877 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:01,877 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:01,877 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:01,877 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:01,877 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:01,877 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:01,877 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:01,877 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:54:01,877 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:01,877 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:01,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:02,061 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:02,061 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:02,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:02,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:02,064 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:02,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:54:02,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:02,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:02,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:02,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:02,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:02,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:02,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:02,088 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:02,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:54:02,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:02,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:02,103 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:02,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:54:02,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:02,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:02,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:02,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:02,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:02,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:02,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:02,120 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:02,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:54:02,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:02,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:02,128 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:02,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:54:02,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:02,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:02,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:02,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:02,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:02,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:02,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:02,149 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:02,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:54:02,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:02,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:02,157 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:02,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:54:02,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:02,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:02,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:02,168 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:54:02,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:02,174 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:54:02,174 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:54:02,185 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:02,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:54:02,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:02,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:02,193 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:02,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:54:02,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:02,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:02,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:02,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:02,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:02,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:02,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:02,215 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:02,223 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:54:02,223 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:54:02,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:02,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:02,226 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:02,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:54:02,230 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:02,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:54:02,248 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:02,248 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:02,249 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, i3) = 1*k - 1*i3 Supporting invariants [] [2025-04-26 16:54:02,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:54:02,255 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:02,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:02,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:02,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:02,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:02,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:02,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:02,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:02,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:02,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:02,286 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:02,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:02,297 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:54:02,297 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4915 states and 12259 transitions. cyclomatic complexity: 7836 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:02,474 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4915 states and 12259 transitions. cyclomatic complexity: 7836. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 12412 states and 32415 transitions. Complement of second has 6 states. [2025-04-26 16:54:02,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-04-26 16:54:02,476 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 108 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:54:02,476 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:02,476 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 108 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:54:02,476 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:02,476 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 108 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:54:02,476 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:02,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12412 states and 32415 transitions. [2025-04-26 16:54:02,578 INFO L131 ngComponentsAnalysis]: Automaton has 170 accepting balls. 609 [2025-04-26 16:54:02,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12412 states to 8662 states and 22444 transitions. [2025-04-26 16:54:02,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2717 [2025-04-26 16:54:02,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3084 [2025-04-26 16:54:02,713 INFO L74 IsDeterministic]: Start isDeterministic. Operand 8662 states and 22444 transitions. [2025-04-26 16:54:02,714 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:02,714 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8662 states and 22444 transitions. [2025-04-26 16:54:02,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8662 states and 22444 transitions. [2025-04-26 16:54:02,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8662 to 7768. [2025-04-26 16:54:02,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7768 states, 7768 states have (on average 2.585478887744593) internal successors, (in total 20084), 7767 states have internal predecessors, (20084), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:02,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7768 states to 7768 states and 20084 transitions. [2025-04-26 16:54:02,874 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7768 states and 20084 transitions. [2025-04-26 16:54:02,875 INFO L438 stractBuchiCegarLoop]: Abstraction has 7768 states and 20084 transitions. [2025-04-26 16:54:02,875 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:54:02,875 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7768 states and 20084 transitions. [2025-04-26 16:54:02,907 INFO L131 ngComponentsAnalysis]: Automaton has 170 accepting balls. 609 [2025-04-26 16:54:02,907 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:02,907 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:02,907 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:02,907 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:54:02,908 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (<= 0 v_k_2) (<= v_k_2 v_N_3)) InVars {k=v_k_2, N=v_N_3} OutVars{k=v_k_2, N=v_N_3} AuxVars[] AssignedVars[]" "[72] L97-->L98: Formula: (= (select v_A_2 0) v_array_min_3) InVars {A=v_A_2} OutVars{A=v_A_2, array_min=v_array_min_3} AuxVars[] AssignedVars[array_min]" "[67] L98-->L100: Formula: (= v_array_max_1 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max]" "[140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0]" "[143] L100-1-->$Ultimate##0: Formula: (and (= 2 v_computeMin2Thread1of1ForFork3_thidvar0_2) (= 2 v_computeMin2Thread1of1ForFork3_thidvar1_2)) InVars {} OutVars{computeMin2Thread1of1ForFork3_thidvar0=v_computeMin2Thread1of1ForFork3_thidvar0_2, computeMin2Thread1of1ForFork3_thidvar1=v_computeMin2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[computeMin2Thread1of1ForFork3_thidvar0, computeMin2Thread1of1ForFork3_thidvar1]" "[146] L101-->$Ultimate##0: Formula: (and (= v_computeMax1Thread1of1ForFork4_thidvar2_2 3) (= v_computeMax1Thread1of1ForFork4_thidvar0_2 3) (= v_computeMax1Thread1of1ForFork4_thidvar1_2 3)) InVars {} OutVars{computeMax1Thread1of1ForFork4_thidvar0=v_computeMax1Thread1of1ForFork4_thidvar0_2, computeMax1Thread1of1ForFork4_thidvar1=v_computeMax1Thread1of1ForFork4_thidvar1_2, computeMax1Thread1of1ForFork4_thidvar2=v_computeMax1Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[computeMax1Thread1of1ForFork4_thidvar0, computeMax1Thread1of1ForFork4_thidvar1, computeMax1Thread1of1ForFork4_thidvar2]" "[134] L102-->$Ultimate##0: Formula: (and (= v_computeMax2Thread1of1ForFork0_thidvar1_2 4) (= v_computeMax2Thread1of1ForFork0_thidvar3_2 4) (= v_computeMax2Thread1of1ForFork0_thidvar2_2 4) (= v_computeMax2Thread1of1ForFork0_thidvar0_2 4)) InVars {} OutVars{computeMax2Thread1of1ForFork0_thidvar3=v_computeMax2Thread1of1ForFork0_thidvar3_2, computeMax2Thread1of1ForFork0_thidvar2=v_computeMax2Thread1of1ForFork0_thidvar2_2, computeMax2Thread1of1ForFork0_thidvar1=v_computeMax2Thread1of1ForFork0_thidvar1_2, computeMax2Thread1of1ForFork0_thidvar0=v_computeMax2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMax2Thread1of1ForFork0_thidvar3, computeMax2Thread1of1ForFork0_thidvar2, computeMax2Thread1of1ForFork0_thidvar1, computeMax2Thread1of1ForFork0_thidvar0]" "[117] $Ultimate##0-->L74-1: Formula: (= v_i4_1 (+ v_k_5 1)) InVars {k=v_k_5} OutVars{k=v_k_5, i4=v_i4_1} AuxVars[] AssignedVars[i4]" [2025-04-26 16:54:02,908 INFO L754 eck$LassoCheckResult]: Loop: "[119] L74-1-->L74: Formula: (< v_i4_2 v_N_4) InVars {N=v_N_4, i4=v_i4_2} OutVars{N=v_N_4, i4=v_i4_2} AuxVars[] AssignedVars[]" "[121] L74-->L74-1: Formula: (and (= (let ((.cse0 (select v_A_11 v_i4_9))) (ite (< v_array_max_11 .cse0) .cse0 v_array_max_11)) v_array_max_10) (= (+ v_i4_9 1) v_i4_8)) InVars {A=v_A_11, array_max=v_array_max_11, i4=v_i4_9} OutVars{A=v_A_11, array_max=v_array_max_10, i4=v_i4_8} AuxVars[] AssignedVars[array_max, i4]" [2025-04-26 16:54:02,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:02,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356677, now seen corresponding path program 1 times [2025-04-26 16:54:02,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:02,908 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472130555] [2025-04-26 16:54:02,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:02,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:02,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:02,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:02,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:02,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:02,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:02,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:02,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:02,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:02,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:02,920 INFO L85 PathProgramCache]: Analyzing trace with hash 4771, now seen corresponding path program 1 times [2025-04-26 16:54:02,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:02,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727940576] [2025-04-26 16:54:02,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:02,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:02,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:02,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:02,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:02,929 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:02,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:02,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:02,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:02,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:02,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:02,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1805152547, now seen corresponding path program 1 times [2025-04-26 16:54:02,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:02,934 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15753883] [2025-04-26 16:54:02,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:02,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:02,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:54:02,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:02,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:02,941 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:02,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:54:02,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:02,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:02,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:03,133 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:03,133 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:03,133 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:03,133 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:03,133 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:03,133 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,133 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:03,133 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:03,133 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:54:03,133 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:03,133 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:03,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:03,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:03,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:03,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:03,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:03,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:03,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:03,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:03,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:03,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:03,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:03,306 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:03,307 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:03,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:03,308 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:03,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:54:03,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:03,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:03,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:03,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:03,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:03,323 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:03,323 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:03,325 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:03,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:54:03,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:03,333 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:03,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:54:03,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:03,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:03,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:03,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:03,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:03,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:03,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:03,351 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:03,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:54:03,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:03,360 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:03,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:54:03,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:03,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:03,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:03,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:03,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:03,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:03,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:03,390 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:03,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:54:03,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:03,401 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:03,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:54:03,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:03,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:03,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:03,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:03,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:03,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:03,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:03,420 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:03,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:03,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:03,429 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:03,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:54:03,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:03,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:03,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:03,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:03,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:03,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:03,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:03,446 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:03,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:54:03,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:03,454 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:03,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:54:03,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:03,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:03,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:03,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:03,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:03,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:03,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:03,471 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:03,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:03,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:03,479 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:03,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:54:03,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:03,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:03,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:03,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:03,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:03,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:03,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:03,496 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:03,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:03,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:03,505 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:03,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:54:03,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:03,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:03,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:03,518 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:54:03,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:03,527 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:54:03,527 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:54:03,538 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:03,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:03,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:03,547 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:03,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:54:03,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:03,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:03,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:03,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:03,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:03,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:03,563 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:03,568 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:03,573 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:54:03,573 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:54:03,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:03,576 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:03,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:54:03,578 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:03,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:54:03,596 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:03,596 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:03,597 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i4, N) = -1*i4 + 1*N Supporting invariants [] [2025-04-26 16:54:03,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:54:03,602 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:03,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:03,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:03,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:03,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:03,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:03,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:03,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:03,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:03,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:03,634 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:03,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:03,645 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:54:03,646 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7768 states and 20084 transitions. cyclomatic complexity: 13019 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:03,866 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7768 states and 20084 transitions. cyclomatic complexity: 13019. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 19691 states and 52255 transitions. Complement of second has 6 states. [2025-04-26 16:54:03,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:03,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-04-26 16:54:03,867 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:54:03,867 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:03,867 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:54:03,867 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:03,867 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:54:03,867 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:03,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19691 states and 52255 transitions. [2025-04-26 16:54:04,049 INFO L131 ngComponentsAnalysis]: Automaton has 100 accepting balls. 400 [2025-04-26 16:54:04,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19691 states to 12844 states and 34154 transitions. [2025-04-26 16:54:04,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3070 [2025-04-26 16:54:04,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3396 [2025-04-26 16:54:04,201 INFO L74 IsDeterministic]: Start isDeterministic. Operand 12844 states and 34154 transitions. [2025-04-26 16:54:04,201 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:04,201 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12844 states and 34154 transitions. [2025-04-26 16:54:04,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12844 states and 34154 transitions. [2025-04-26 16:54:04,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12844 to 11492. [2025-04-26 16:54:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11492 states, 11492 states have (on average 2.6824747650539504) internal successors, (in total 30827), 11491 states have internal predecessors, (30827), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11492 states to 11492 states and 30827 transitions. [2025-04-26 16:54:04,493 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11492 states and 30827 transitions. [2025-04-26 16:54:04,493 INFO L438 stractBuchiCegarLoop]: Abstraction has 11492 states and 30827 transitions. [2025-04-26 16:54:04,493 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:54:04,493 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11492 states and 30827 transitions. [2025-04-26 16:54:04,545 INFO L131 ngComponentsAnalysis]: Automaton has 100 accepting balls. 400 [2025-04-26 16:54:04,545 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:04,545 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:04,545 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:04,546 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:54:04,546 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (<= 0 v_k_2) (<= v_k_2 v_N_3)) InVars {k=v_k_2, N=v_N_3} OutVars{k=v_k_2, N=v_N_3} AuxVars[] AssignedVars[]" "[72] L97-->L98: Formula: (= (select v_A_2 0) v_array_min_3) InVars {A=v_A_2} OutVars{A=v_A_2, array_min=v_array_min_3} AuxVars[] AssignedVars[array_min]" "[67] L98-->L100: Formula: (= v_array_max_1 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max]" "[140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0]" "[143] L100-1-->$Ultimate##0: Formula: (and (= 2 v_computeMin2Thread1of1ForFork3_thidvar0_2) (= 2 v_computeMin2Thread1of1ForFork3_thidvar1_2)) InVars {} OutVars{computeMin2Thread1of1ForFork3_thidvar0=v_computeMin2Thread1of1ForFork3_thidvar0_2, computeMin2Thread1of1ForFork3_thidvar1=v_computeMin2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[computeMin2Thread1of1ForFork3_thidvar0, computeMin2Thread1of1ForFork3_thidvar1]" "[146] L101-->$Ultimate##0: Formula: (and (= v_computeMax1Thread1of1ForFork4_thidvar2_2 3) (= v_computeMax1Thread1of1ForFork4_thidvar0_2 3) (= v_computeMax1Thread1of1ForFork4_thidvar1_2 3)) InVars {} OutVars{computeMax1Thread1of1ForFork4_thidvar0=v_computeMax1Thread1of1ForFork4_thidvar0_2, computeMax1Thread1of1ForFork4_thidvar1=v_computeMax1Thread1of1ForFork4_thidvar1_2, computeMax1Thread1of1ForFork4_thidvar2=v_computeMax1Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[computeMax1Thread1of1ForFork4_thidvar0, computeMax1Thread1of1ForFork4_thidvar1, computeMax1Thread1of1ForFork4_thidvar2]" "[134] L102-->$Ultimate##0: Formula: (and (= v_computeMax2Thread1of1ForFork0_thidvar1_2 4) (= v_computeMax2Thread1of1ForFork0_thidvar3_2 4) (= v_computeMax2Thread1of1ForFork0_thidvar2_2 4) (= v_computeMax2Thread1of1ForFork0_thidvar0_2 4)) InVars {} OutVars{computeMax2Thread1of1ForFork0_thidvar3=v_computeMax2Thread1of1ForFork0_thidvar3_2, computeMax2Thread1of1ForFork0_thidvar2=v_computeMax2Thread1of1ForFork0_thidvar2_2, computeMax2Thread1of1ForFork0_thidvar1=v_computeMax2Thread1of1ForFork0_thidvar1_2, computeMax2Thread1of1ForFork0_thidvar0=v_computeMax2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMax2Thread1of1ForFork0_thidvar3, computeMax2Thread1of1ForFork0_thidvar2, computeMax2Thread1of1ForFork0_thidvar1, computeMax2Thread1of1ForFork0_thidvar0]" "[137] L103-->L84: Formula: (and (= 5 v_sampleThread1of1ForFork1_thidvar4_2) (= 5 v_sampleThread1of1ForFork1_thidvar1_2) (= 5 v_sampleThread1of1ForFork1_thidvar0_2) (= 5 v_sampleThread1of1ForFork1_thidvar3_2) (= 5 v_sampleThread1of1ForFork1_thidvar2_2)) InVars {} OutVars{sampleThread1of1ForFork1_thidvar1=v_sampleThread1of1ForFork1_thidvar1_2, sampleThread1of1ForFork1_thidvar0=v_sampleThread1of1ForFork1_thidvar0_2, sampleThread1of1ForFork1_thidvar3=v_sampleThread1of1ForFork1_thidvar3_2, sampleThread1of1ForFork1_thidvar2=v_sampleThread1of1ForFork1_thidvar2_2, sampleThread1of1ForFork1_thidvar4=v_sampleThread1of1ForFork1_thidvar4_2} AuxVars[] AssignedVars[sampleThread1of1ForFork1_thidvar1, sampleThread1of1ForFork1_thidvar0, sampleThread1of1ForFork1_thidvar3, sampleThread1of1ForFork1_thidvar2, sampleThread1of1ForFork1_thidvar4]" [2025-04-26 16:54:04,547 INFO L754 eck$LassoCheckResult]: Loop: "[128] L84-->L86: Formula: (= v_min_samples_1 (store v_min_samples_2 (+ (- 1) v_i1_7) v_array_min_8)) InVars {min_samples=v_min_samples_2, i1=v_i1_7, array_min=v_array_min_8} OutVars{min_samples=v_min_samples_1, i1=v_i1_7, array_min=v_array_min_8} AuxVars[] AssignedVars[min_samples]" "[129] L86-->L87: Formula: (= v_min_samples_3 (store v_min_samples_4 (+ (- 1) v_i2_7) v_array_min_9)) InVars {min_samples=v_min_samples_4, i2=v_i2_7, array_min=v_array_min_9} OutVars{min_samples=v_min_samples_3, i2=v_i2_7, array_min=v_array_min_9} AuxVars[] AssignedVars[min_samples]" "[130] L87-->L88: Formula: (= (store v_max_samples_2 (+ (- 1) v_i3_7) v_array_max_8) v_max_samples_1) InVars {array_max=v_array_max_8, max_samples=v_max_samples_2, i3=v_i3_7} OutVars{array_max=v_array_max_8, max_samples=v_max_samples_1, i3=v_i3_7} AuxVars[] AssignedVars[max_samples]" "[131] L88-->L84: Formula: (= (store v_max_samples_4 (+ (- 1) v_i4_7) v_array_max_9) v_max_samples_3) InVars {array_max=v_array_max_9, max_samples=v_max_samples_4, i4=v_i4_7} OutVars{array_max=v_array_max_9, max_samples=v_max_samples_3, i4=v_i4_7} AuxVars[] AssignedVars[max_samples]" [2025-04-26 16:54:04,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:04,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356657, now seen corresponding path program 1 times [2025-04-26 16:54:04,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:04,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533281866] [2025-04-26 16:54:04,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:04,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:04,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:04,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:04,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,554 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:04,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:04,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:04,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:04,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:04,564 INFO L85 PathProgramCache]: Analyzing trace with hash 4864899, now seen corresponding path program 1 times [2025-04-26 16:54:04,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:04,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993442020] [2025-04-26 16:54:04,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:04,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:04,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:04,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:04,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,574 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:04,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:04,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:04,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:04,582 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:04,582 INFO L85 PathProgramCache]: Analyzing trace with hash 433940305, now seen corresponding path program 1 times [2025-04-26 16:54:04,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:04,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84468948] [2025-04-26 16:54:04,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:04,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:04,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:54:04,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:54:04,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,598 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:04,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:54:04,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:54:04,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:04,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:04,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:04,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,786 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:04,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:04,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:04,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:54:04,825 INFO L201 PluginConnector]: Adding new model min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:54:04 BoogieIcfgContainer [2025-04-26 16:54:04,825 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:54:04,826 INFO L158 Benchmark]: Toolchain (without parser) took 6438.93ms. Allocated memory was 155.2MB in the beginning and 507.5MB in the end (delta: 352.3MB). Free memory was 83.3MB in the beginning and 193.2MB in the end (delta: -109.9MB). Peak memory consumption was 238.6MB. Max. memory is 8.0GB. [2025-04-26 16:54:04,826 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:04,826 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.15ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 81.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:04,826 INFO L158 Benchmark]: Boogie Preprocessor took 23.23ms. Allocated memory is still 155.2MB. Free memory was 81.4MB in the beginning and 80.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:04,828 INFO L158 Benchmark]: RCFGBuilder took 229.73ms. Allocated memory is still 155.2MB. Free memory was 80.1MB in the beginning and 69.6MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:54:04,829 INFO L158 Benchmark]: BuchiAutomizer took 6156.10ms. Allocated memory was 155.2MB in the beginning and 507.5MB in the end (delta: 352.3MB). Free memory was 69.4MB in the beginning and 193.2MB in the end (delta: -123.7MB). Peak memory consumption was 226.0MB. Max. memory is 8.0GB. [2025-04-26 16:54:04,830 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.15ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 81.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.23ms. Allocated memory is still 155.2MB. Free memory was 81.4MB in the beginning and 80.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 229.73ms. Allocated memory is still 155.2MB. Free memory was 80.1MB in the beginning and 69.6MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 6156.10ms. Allocated memory was 155.2MB in the beginning and 507.5MB in the end (delta: 352.3MB). Free memory was 69.4MB in the beginning and 193.2MB in the end (delta: -123.7MB). Peak memory consumption was 226.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 0.8s AutomataMinimizationTime, 4 MinimizatonAttempts, 3229 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.7s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 391 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 387 mSDsluCounter, 298 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 141 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 230 IncrementalHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 157 mSDtfsCounter, 230 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital70 mio100 ax100 hnf100 lsp110 ukn59 mio100 lsp56 div100 bol100 ite100 ukn100 eq170 hnf94 smp100 dnf149 smp63 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 4 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.7s InitialAbstraction: Time to compute Ample Reduction [ms]: 782, Number of transitions in reduction automaton: 5353, Number of states in reduction automaton: 2472, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function k + -1 * i1 and consists of 4 locations. One deterministic module has affine ranking function -1 * i2 + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i3 + k and consists of 4 locations. One deterministic module has affine ranking function N + -1 * i4 and consists of 4 locations. The remainder module has 11492 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 84]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L95] 0 assume 0 <= k && k <= N; VAL [N=0, k=0] [L97] 0 array_min := A[0]; VAL [N=0, array_min=8, k=0] [L98] 0 array_max := A[0]; VAL [N=0, array_max=8, array_min=8, k=0] [L100] FORK 0 fork 1 computeMin1(); VAL [N=0, array_max=8, array_min=8, k=0] [L101] FORK 0 fork 2, 2 computeMin2(); VAL [N=0, array_max=8, array_min=8, k=0] [L102] FORK 0 fork 3, 3, 3 computeMax1(); VAL [N=0, array_max=8, array_min=8, k=0] [L103] FORK 0 fork 4, 4, 4, 4 computeMax2(); VAL [N=0, array_max=8, array_min=8, k=0] [L104] FORK 0 fork 5, 5, 5, 5, 5 sample(); VAL [N=0, array_max=8, array_min=8, k=0] Loop: [L85] min_samples[i1 - 1] := array_min; [L86] min_samples[i2 - 1] := array_min; [L87] max_samples[i3 - 1] := array_max; [L88] max_samples[i4 - 1] := array_max; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 84]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L95] 0 assume 0 <= k && k <= N; VAL [N=0, k=0] [L97] 0 array_min := A[0]; VAL [N=0, array_min=8, k=0] [L98] 0 array_max := A[0]; VAL [N=0, array_max=8, array_min=8, k=0] [L100] FORK 0 fork 1 computeMin1(); VAL [N=0, array_max=8, array_min=8, k=0] [L101] FORK 0 fork 2, 2 computeMin2(); VAL [N=0, array_max=8, array_min=8, k=0] [L102] FORK 0 fork 3, 3, 3 computeMax1(); VAL [N=0, array_max=8, array_min=8, k=0] [L103] FORK 0 fork 4, 4, 4, 4 computeMax2(); VAL [N=0, array_max=8, array_min=8, k=0] [L104] FORK 0 fork 5, 5, 5, 5, 5 sample(); VAL [N=0, array_max=8, array_min=8, k=0] Loop: [L85] min_samples[i1 - 1] := array_min; [L86] min_samples[i2 - 1] := array_min; [L87] max_samples[i3 - 1] := array_max; [L88] max_samples[i4 - 1] := array_max; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:54:04,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...