/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 18:39:24,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:39:24,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:39:24,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:39:24,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:39:24,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:39:24,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:39:24,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:39:24,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:39:24,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:39:24,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:39:24,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:39:24,214 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:39:24,215 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:39:24,215 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:39:24,215 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:39:24,215 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:39:24,215 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:39:24,215 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:39:24,215 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:39:24,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:39:24,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:39:24,215 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:39:24,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:39:24,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:39:24,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:39:24,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:39:24,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:39:24,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:39:24,215 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:39:24,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:39:24,216 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:39:24,216 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:39:24,216 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:39:24,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:39:24,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:24,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:39:24,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:39:24,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:39:24,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:39:24,216 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:39:24,216 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:39:24,216 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:39:24,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:39:24,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:39:24,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:39:24,497 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:39:24,497 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:39:24,498 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 18:39:24,500 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-split-sample.bpl' [2025-04-26 18:39:24,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:39:24,519 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:39:24,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:24,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:39:24,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:39:24,527 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 06:39:24" (1/1) ... [2025-04-26 18:39:24,547 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 06:39:24" (1/1) ... [2025-04-26 18:39:24,552 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:39:24,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:39:24,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:39:24,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:39:24,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:39:24,558 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 06:39:24" (1/1) ... [2025-04-26 18:39:24,559 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 06:39:24" (1/1) ... [2025-04-26 18:39:24,559 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 06:39:24" (1/1) ... [2025-04-26 18:39:24,559 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 06:39:24" (1/1) ... [2025-04-26 18:39:24,561 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 06:39:24" (1/1) ... [2025-04-26 18:39:24,561 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 06:39:24" (1/1) ... [2025-04-26 18:39:24,564 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 06:39:24" (1/1) ... [2025-04-26 18:39:24,564 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 06:39:24" (1/1) ... [2025-04-26 18:39:24,565 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 06:39:24" (1/1) ... [2025-04-26 18:39:24,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:39:24,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:39:24,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:39:24,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:39:24,573 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 06:39:24" (1/1) ... [2025-04-26 18:39:24,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:39:24,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:24,595 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 18:39:24,598 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 18:39:24,616 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin2 given in one single declaration [2025-04-26 18:39:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin2 [2025-04-26 18:39:24,616 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin2 [2025-04-26 18:39:24,616 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:39:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:39:24,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:39:24,616 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin1 given in one single declaration [2025-04-26 18:39:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin1 [2025-04-26 18:39:24,616 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin1 [2025-04-26 18:39:24,616 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax2 given in one single declaration [2025-04-26 18:39:24,616 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax2 [2025-04-26 18:39:24,616 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax2 [2025-04-26 18:39:24,617 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax1 given in one single declaration [2025-04-26 18:39:24,617 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax1 [2025-04-26 18:39:24,617 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax1 [2025-04-26 18:39:24,617 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2025-04-26 18:39:24,617 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2025-04-26 18:39:24,617 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2025-04-26 18:39:24,617 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 18:39:24,652 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:39:24,654 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:39:24,756 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:39:24,756 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:39:24,771 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:39:24,771 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-26 18:39:24,772 INFO L201 PluginConnector]: Adding new model min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:39:24 BoogieIcfgContainer [2025-04-26 18:39:24,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:39:24,772 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:39:24,772 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:39:24,778 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:39:24,779 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:24,779 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 06:39:24" (1/2) ... [2025-04-26 18:39:24,780 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@596a38e2 and model type min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:39:24, skipping insertion in model container [2025-04-26 18:39:24,780 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:39:24,780 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 06:39:24" (2/2) ... [2025-04-26 18:39:24,781 INFO L376 chiAutomizerObserver]: Analyzing ICFG min-max-split-sample.bpl [2025-04-26 18:39:24,831 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:39:24,858 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:39:24,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:39:24,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:24,860 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 18:39:24,862 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 18:39:24,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 132 flow [2025-04-26 18:39:24,924 INFO L116 PetriNetUnfolderBase]: 5/40 cut-off events. [2025-04-26 18:39:24,926 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:39:24,929 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 18:39:24,929 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 50 transitions, 132 flow [2025-04-26 18:39:24,931 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 40 transitions, 107 flow [2025-04-26 18:39:24,931 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 51 places, 40 transitions, 107 flow [2025-04-26 18:39:24,932 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 40 transitions, 107 flow [2025-04-26 18:39:25,132 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4704 states, 4702 states have (on average 4.908336877924287) internal successors, (in total 23079), 4703 states have internal predecessors, (23079), 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 18:39:25,146 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 4704 states, 4702 states have (on average 4.908336877924287) internal successors, (in total 23079), 4703 states have internal predecessors, (23079), 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 18:39:25,148 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:25,650 WARN L140 AmpleReduction]: Number of pruned transitions: 5485 [2025-04-26 18:39:25,650 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:39:25,650 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 465 [2025-04-26 18:39:25,651 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:147 [2025-04-26 18:39:25,651 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:1860 [2025-04-26 18:39:25,651 WARN L145 AmpleReduction]: Times succ was already a loop node:1105 [2025-04-26 18:39:25,651 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:146 [2025-04-26 18:39:25,651 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:25,656 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 2473 states, 2471 states have (on average 2.1667341157426145) internal successors, (in total 5354), 2472 states have internal predecessors, (5354), 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 18:39:25,668 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:25,668 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:25,668 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:25,668 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:25,668 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:25,668 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:25,668 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:25,669 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:25,677 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2473 states, 2471 states have (on average 2.1667341157426145) internal successors, (in total 5354), 2472 states have internal predecessors, (5354), 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 18:39:25,754 INFO L131 ngComponentsAnalysis]: Automaton has 321 accepting balls. 1455 [2025-04-26 18:39:25,754 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:25,754 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:25,759 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:39:25,759 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:25,759 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:25,763 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2473 states, 2471 states have (on average 2.1667341157426145) internal successors, (in total 5354), 2472 states have internal predecessors, (5354), 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 18:39:25,795 INFO L131 ngComponentsAnalysis]: Automaton has 321 accepting balls. 1455 [2025-04-26 18:39:25,795 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:25,795 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:25,796 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:39:25,796 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:25,800 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 18:39:25,800 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 18:39:25,804 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:25,804 INFO L85 PathProgramCache]: Analyzing trace with hash 127812647, now seen corresponding path program 1 times [2025-04-26 18:39:25,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:25,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897274005] [2025-04-26 18:39:25,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:25,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:25,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:25,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:25,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:25,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:25,866 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:25,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:25,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:25,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:25,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:25,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:25,888 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:25,888 INFO L85 PathProgramCache]: Analyzing trace with hash 4611, now seen corresponding path program 1 times [2025-04-26 18:39:25,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:25,888 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617087426] [2025-04-26 18:39:25,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:25,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:25,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:25,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:25,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:25,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:25,899 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:25,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:25,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:25,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:25,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:25,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:25,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:25,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1726094167, now seen corresponding path program 1 times [2025-04-26 18:39:25,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:25,911 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396910686] [2025-04-26 18:39:25,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:25,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:25,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:25,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:25,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:25,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:25,925 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:25,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:25,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:25,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:25,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:25,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:26,140 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:26,141 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:26,141 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:26,141 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:26,141 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:26,141 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:26,141 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:26,141 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:26,141 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:39:26,141 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:26,141 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:26,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:26,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:26,322 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:26,325 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:26,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:26,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:26,330 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 18:39:26,331 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 18:39:26,332 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 18:39:26,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:26,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:26,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:26,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:26,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:26,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:26,363 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:26,373 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:39:26,373 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:39:26,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:26,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:26,378 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 18:39:26,379 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 18:39:26,379 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:26,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:39:26,398 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:26,399 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:26,399 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, k) = -1*i1 + 1*k Supporting invariants [] [2025-04-26 18:39:26,405 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 18:39:26,408 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:26,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:26,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:39:26,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:39:26,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:26,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:26,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:26,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:26,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:26,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:26,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:26,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:26,467 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:26,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:26,488 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 18:39:26,506 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 18:39:26,510 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 2473 states, 2471 states have (on average 2.1667341157426145) internal successors, (in total 5354), 2472 states have internal predecessors, (5354), 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 18:39:26,714 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 2473 states, 2471 states have (on average 2.1667341157426145) internal successors, (in total 5354), 2472 states have internal predecessors, (5354), 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 5069 states and 12057 transitions. Complement of second has 6 states. [2025-04-26 18:39:26,715 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 18:39:26,719 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 18:39:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-04-26 18:39:26,724 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:39:26,725 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:26,725 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:39:26,725 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:26,725 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:39:26,725 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:26,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5069 states and 12057 transitions. [2025-04-26 18:39:26,777 INFO L131 ngComponentsAnalysis]: Automaton has 281 accepting balls. 1138 [2025-04-26 18:39:26,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5069 states to 3677 states and 8678 transitions. [2025-04-26 18:39:26,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2251 [2025-04-26 18:39:26,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2766 [2025-04-26 18:39:26,835 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3677 states and 8678 transitions. [2025-04-26 18:39:26,836 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:26,836 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3677 states and 8678 transitions. [2025-04-26 18:39:26,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states and 8678 transitions. [2025-04-26 18:39:26,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 3300. [2025-04-26 18:39:26,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3300 states have (on average 2.340909090909091) internal successors, (in total 7725), 3299 states have internal predecessors, (7725), 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 18:39:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 7725 transitions. [2025-04-26 18:39:26,977 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3300 states and 7725 transitions. [2025-04-26 18:39:26,977 INFO L438 stractBuchiCegarLoop]: Abstraction has 3300 states and 7725 transitions. [2025-04-26 18:39:26,977 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:39:26,977 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3300 states and 7725 transitions. [2025-04-26 18:39:26,990 INFO L131 ngComponentsAnalysis]: Automaton has 281 accepting balls. 1138 [2025-04-26 18:39:26,991 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:26,991 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:26,991 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:39:26,991 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:26,991 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 18:39:26,991 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 18:39:26,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:26,992 INFO L85 PathProgramCache]: Analyzing trace with hash -332774171, now seen corresponding path program 1 times [2025-04-26 18:39:26,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:26,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798404016] [2025-04-26 18:39:26,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:26,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:26,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:26,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:26,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:26,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:26,996 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:26,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:26,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:26,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:26,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:27,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:27,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:27,004 INFO L85 PathProgramCache]: Analyzing trace with hash 4451, now seen corresponding path program 1 times [2025-04-26 18:39:27,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:27,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109257324] [2025-04-26 18:39:27,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:27,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:27,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:27,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:27,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:27,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:27,008 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:27,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:27,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:27,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:27,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:27,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:27,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:27,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1968394937, now seen corresponding path program 1 times [2025-04-26 18:39:27,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:27,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678248239] [2025-04-26 18:39:27,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:27,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:27,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:27,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:27,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:27,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:27,016 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:27,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:27,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:27,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:27,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:27,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:27,143 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:27,143 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:27,143 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:27,143 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:27,143 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:27,143 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:27,143 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:27,144 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:27,144 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:39:27,144 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:27,144 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:27,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:27,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:27,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:27,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:27,287 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:27,287 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:27,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:27,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:27,289 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 18:39:27,291 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 18:39:27,292 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 18:39:27,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:27,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:27,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:27,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:27,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:27,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:27,308 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:27,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:39:27,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:27,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:27,316 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 18:39:27,318 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 18:39:27,321 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 18:39:27,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:27,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:27,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:27,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:27,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:27,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:27,360 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:27,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:27,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:27,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:27,368 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 18:39:27,370 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 18:39:27,371 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 18:39:27,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:27,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:27,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:27,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:27,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:27,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:27,399 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:27,411 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:39:27,412 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:39:27,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:27,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:27,414 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 18:39:27,415 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 18:39:27,416 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:27,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:27,435 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:27,435 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:27,435 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2025-04-26 18:39:27,441 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 18:39:27,442 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:27,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:27,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:39:27,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:39:27,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:27,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:27,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:27,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:27,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:27,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:27,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:27,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:27,477 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:27,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:27,491 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 18:39:27,491 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 18:39:27,491 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3300 states and 7725 transitions. cyclomatic complexity: 4803 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 18:39:27,615 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3300 states and 7725 transitions. cyclomatic complexity: 4803. 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 7710 states and 19416 transitions. Complement of second has 6 states. [2025-04-26 18:39:27,616 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 18:39:27,616 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 18:39:27,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-04-26 18:39:27,616 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 108 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:39:27,616 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:27,617 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 108 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:39:27,617 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:27,617 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 108 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 18:39:27,617 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:27,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7710 states and 19416 transitions. [2025-04-26 18:39:27,671 INFO L131 ngComponentsAnalysis]: Automaton has 233 accepting balls. 840 [2025-04-26 18:39:27,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7710 states to 5522 states and 13864 transitions. [2025-04-26 18:39:27,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2368 [2025-04-26 18:39:27,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2852 [2025-04-26 18:39:27,716 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5522 states and 13864 transitions. [2025-04-26 18:39:27,716 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:27,716 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5522 states and 13864 transitions. [2025-04-26 18:39:27,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states and 13864 transitions. [2025-04-26 18:39:27,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 4914. [2025-04-26 18:39:27,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4914 states, 4914 states have (on average 2.494301994301994) internal successors, (in total 12257), 4913 states have internal predecessors, (12257), 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 18:39:27,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4914 states to 4914 states and 12257 transitions. [2025-04-26 18:39:27,848 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4914 states and 12257 transitions. [2025-04-26 18:39:27,848 INFO L438 stractBuchiCegarLoop]: Abstraction has 4914 states and 12257 transitions. [2025-04-26 18:39:27,848 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:39:27,848 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4914 states and 12257 transitions. [2025-04-26 18:39:27,868 INFO L131 ngComponentsAnalysis]: Automaton has 233 accepting balls. 840 [2025-04-26 18:39:27,869 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:27,869 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:27,869 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:27,869 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:27,869 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 18:39:27,870 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 18:39:27,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:27,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1726063378, now seen corresponding path program 1 times [2025-04-26 18:39:27,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:27,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306525790] [2025-04-26 18:39:27,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:27,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:27,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:27,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:27,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:27,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:27,875 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:27,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:27,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:27,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:27,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:27,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:27,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:27,883 INFO L85 PathProgramCache]: Analyzing trace with hash 4931, now seen corresponding path program 1 times [2025-04-26 18:39:27,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:27,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992649714] [2025-04-26 18:39:27,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:27,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:27,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:27,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:27,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:27,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:27,888 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:27,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:27,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:27,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:27,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:27,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:27,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:27,893 INFO L85 PathProgramCache]: Analyzing trace with hash -889526032, now seen corresponding path program 1 times [2025-04-26 18:39:27,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:27,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456964990] [2025-04-26 18:39:27,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:27,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:27,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:27,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:27,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:27,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:27,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:27,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:27,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:27,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:27,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:27,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:28,025 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:28,025 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:28,025 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:28,025 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:28,025 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:28,025 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:28,025 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:28,025 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:28,025 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:39:28,025 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:28,026 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:28,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:28,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:28,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:28,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:28,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:28,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:28,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:28,178 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:28,179 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:28,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:28,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:28,181 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 18:39:28,182 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 18:39:28,184 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 18:39:28,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:28,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:28,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:28,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:28,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:28,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:28,199 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:28,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:28,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:28,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:28,208 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 18:39:28,209 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 18:39:28,211 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 18:39:28,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:28,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:28,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:28,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:28,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:28,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:28,227 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:28,233 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 18:39:28,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:28,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:28,235 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 18:39:28,237 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 18:39:28,238 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 18:39:28,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:28,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:28,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:28,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:28,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:28,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:28,254 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:28,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:28,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:28,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:28,262 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 18:39:28,263 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 18:39:28,266 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 18:39:28,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:28,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:28,276 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 18:39:28,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:28,284 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 18:39:28,284 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 18:39:28,299 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:28,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:28,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:28,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:28,307 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 18:39:28,308 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 18:39:28,310 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 18:39:28,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:28,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:28,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:28,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:28,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:28,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:28,329 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:28,335 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:39:28,336 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:39:28,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:28,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:28,338 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 18:39:28,339 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 18:39:28,340 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:28,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:28,357 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:28,357 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:28,357 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, i3) = 1*k - 1*i3 Supporting invariants [] [2025-04-26 18:39:28,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:28,364 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:28,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:28,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:39:28,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:39:28,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:28,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:28,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:28,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:28,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:28,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:28,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:28,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:28,402 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:28,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:28,416 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 18:39:28,417 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 18:39:28,417 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4914 states and 12257 transitions. cyclomatic complexity: 7835 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 18:39:28,606 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4914 states and 12257 transitions. cyclomatic complexity: 7835. 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 12409 states and 32392 transitions. Complement of second has 6 states. [2025-04-26 18:39:28,607 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 18:39:28,607 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 18:39:28,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-04-26 18:39:28,608 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 108 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:39:28,608 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:28,608 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 108 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:39:28,608 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:28,608 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 108 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:39:28,608 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:28,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12409 states and 32392 transitions. [2025-04-26 18:39:28,693 INFO L131 ngComponentsAnalysis]: Automaton has 170 accepting balls. 609 [2025-04-26 18:39:28,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12409 states to 8660 states and 22427 transitions. [2025-04-26 18:39:28,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2716 [2025-04-26 18:39:28,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3079 [2025-04-26 18:39:28,765 INFO L74 IsDeterministic]: Start isDeterministic. Operand 8660 states and 22427 transitions. [2025-04-26 18:39:28,765 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:28,765 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8660 states and 22427 transitions. [2025-04-26 18:39:28,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8660 states and 22427 transitions. [2025-04-26 18:39:28,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8660 to 7768. [2025-04-26 18:39:28,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7768 states, 7768 states have (on average 2.5838053553038107) internal successors, (in total 20071), 7767 states have internal predecessors, (20071), 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 18:39:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7768 states to 7768 states and 20071 transitions. [2025-04-26 18:39:28,961 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7768 states and 20071 transitions. [2025-04-26 18:39:28,961 INFO L438 stractBuchiCegarLoop]: Abstraction has 7768 states and 20071 transitions. [2025-04-26 18:39:28,961 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:39:28,961 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7768 states and 20071 transitions. [2025-04-26 18:39:28,995 INFO L131 ngComponentsAnalysis]: Automaton has 170 accepting balls. 609 [2025-04-26 18:39:28,995 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:28,995 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:28,995 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:28,995 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:39:28,996 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 18:39:28,996 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 18:39:28,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:28,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356677, now seen corresponding path program 1 times [2025-04-26 18:39:28,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:28,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197678607] [2025-04-26 18:39:28,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:28,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:28,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:29,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:29,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:29,001 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:29,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:29,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:29,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:29,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:29,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:29,007 INFO L85 PathProgramCache]: Analyzing trace with hash 4771, now seen corresponding path program 1 times [2025-04-26 18:39:29,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:29,007 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580837396] [2025-04-26 18:39:29,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:29,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:29,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:29,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:29,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:29,017 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:29,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:29,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:29,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:29,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:29,021 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:29,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1805152547, now seen corresponding path program 1 times [2025-04-26 18:39:29,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:29,021 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772625432] [2025-04-26 18:39:29,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:29,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:29,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:29,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:29,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:29,026 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:29,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:29,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:29,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:29,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:29,176 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:29,177 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:29,177 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:29,177 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:29,177 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:29,177 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:29,177 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:29,177 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:29,177 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:39:29,177 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:29,177 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:29,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:29,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:29,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:29,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:29,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:29,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:29,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:29,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:29,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:29,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:29,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:29,400 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:29,401 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:29,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:29,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:29,404 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 18:39:29,405 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 18:39:29,406 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 18:39:29,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:29,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:29,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:29,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:29,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:29,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:29,421 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:29,426 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 18:39:29,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:29,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:29,428 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 18:39:29,429 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 18:39:29,429 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 18:39:29,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:29,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:29,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:29,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:29,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:29,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:29,443 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:29,449 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 18:39:29,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:29,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:29,452 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 18:39:29,453 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 18:39:29,454 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 18:39:29,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:29,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:29,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:29,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:29,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:29,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:29,468 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:29,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:29,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:29,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:29,476 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 18:39:29,477 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 18:39:29,478 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 18:39:29,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:29,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:29,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:29,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:29,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:29,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:29,491 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:29,497 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 18:39:29,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:29,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:29,499 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 18:39:29,500 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 18:39:29,501 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 18:39:29,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:29,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:29,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:29,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:29,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:29,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:29,514 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:29,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:29,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:29,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:29,522 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 18:39:29,523 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 18:39:29,525 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 18:39:29,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:29,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:29,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:29,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:29,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:29,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:29,537 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:29,543 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 18:39:29,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:29,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:29,545 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 18:39:29,547 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 18:39:29,548 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 18:39:29,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:29,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:29,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:29,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:29,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:29,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:29,561 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:29,566 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 18:39:29,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:29,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:29,569 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 18:39:29,570 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 18:39:29,571 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 18:39:29,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:29,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:29,581 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 18:39:29,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:29,586 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 18:39:29,586 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 18:39:29,596 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:29,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 18:39:29,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:29,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:29,603 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 18:39:29,605 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 18:39:29,606 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 18:39:29,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:29,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:29,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:29,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:29,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:29,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:29,622 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:29,629 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:39:29,629 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:39:29,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:29,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:29,632 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 18:39:29,632 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 18:39:29,633 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:29,648 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 18:39:29,648 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:29,649 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:29,649 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i4, N) = -1*i4 + 1*N Supporting invariants [] [2025-04-26 18:39:29,654 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 18:39:29,655 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:39:29,666 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:29,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:29,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:29,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:29,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:29,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:29,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:39:29,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:39:29,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:29,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:29,688 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:29,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:29,698 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 18:39:29,698 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 18:39:29,699 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7768 states and 20071 transitions. cyclomatic complexity: 13006 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 18:39:29,906 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7768 states and 20071 transitions. cyclomatic complexity: 13006. 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 19681 states and 52209 transitions. Complement of second has 6 states. [2025-04-26 18:39:29,906 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 18:39:29,907 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 18:39:29,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2025-04-26 18:39:29,907 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:39:29,907 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:29,907 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:39:29,908 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:29,908 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 109 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 18:39:29,908 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:29,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19681 states and 52209 transitions. [2025-04-26 18:39:30,079 INFO L131 ngComponentsAnalysis]: Automaton has 100 accepting balls. 400 [2025-04-26 18:39:30,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19681 states to 12844 states and 34154 transitions. [2025-04-26 18:39:30,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3070 [2025-04-26 18:39:30,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3396 [2025-04-26 18:39:30,205 INFO L74 IsDeterministic]: Start isDeterministic. Operand 12844 states and 34154 transitions. [2025-04-26 18:39:30,205 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:30,205 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12844 states and 34154 transitions. [2025-04-26 18:39:30,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12844 states and 34154 transitions. [2025-04-26 18:39:30,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12844 to 11492. [2025-04-26 18:39:30,453 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 18:39:30,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11492 states to 11492 states and 30827 transitions. [2025-04-26 18:39:30,480 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11492 states and 30827 transitions. [2025-04-26 18:39:30,480 INFO L438 stractBuchiCegarLoop]: Abstraction has 11492 states and 30827 transitions. [2025-04-26 18:39:30,480 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:39:30,480 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11492 states and 30827 transitions. [2025-04-26 18:39:30,518 INFO L131 ngComponentsAnalysis]: Automaton has 100 accepting balls. 400 [2025-04-26 18:39:30,518 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:30,518 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:30,518 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:30,518 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:39:30,519 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 18:39:30,519 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 18:39:30,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:30,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356657, now seen corresponding path program 1 times [2025-04-26 18:39:30,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:30,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089306780] [2025-04-26 18:39:30,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:30,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:30,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:30,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:30,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:30,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:30,529 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:30,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:30,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:30,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:30,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:30,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:30,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:30,536 INFO L85 PathProgramCache]: Analyzing trace with hash 4864899, now seen corresponding path program 1 times [2025-04-26 18:39:30,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:30,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411075844] [2025-04-26 18:39:30,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:30,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:30,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:30,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:30,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:30,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:30,541 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:30,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:39:30,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:39:30,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:30,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:30,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:30,544 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:30,544 INFO L85 PathProgramCache]: Analyzing trace with hash 433940305, now seen corresponding path program 1 times [2025-04-26 18:39:30,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:30,544 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671735209] [2025-04-26 18:39:30,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:30,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:30,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:39:30,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:39:30,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:30,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:30,549 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:30,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:39:30,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:39:30,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:30,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:30,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:30,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:30,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:30,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:30,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:30,826 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:30,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:30,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:30,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:30,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:30,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:30,860 INFO L201 PluginConnector]: Adding new model min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:30 BoogieIcfgContainer [2025-04-26 18:39:30,860 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:30,861 INFO L158 Benchmark]: Toolchain (without parser) took 6341.43ms. Allocated memory was 163.6MB in the beginning and 683.7MB in the end (delta: 520.1MB). Free memory was 91.9MB in the beginning and 506.4MB in the end (delta: -414.4MB). Peak memory consumption was 107.5MB. Max. memory is 8.0GB. [2025-04-26 18:39:30,861 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 163.6MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:30,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.00ms. Allocated memory is still 163.6MB. Free memory was 91.8MB in the beginning and 90.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:30,861 INFO L158 Benchmark]: Boogie Preprocessor took 17.62ms. Allocated memory is still 163.6MB. Free memory was 90.0MB in the beginning and 88.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:30,862 INFO L158 Benchmark]: RCFGBuilder took 199.39ms. Allocated memory is still 163.6MB. Free memory was 88.8MB in the beginning and 78.1MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:39:30,862 INFO L158 Benchmark]: BuchiAutomizer took 6087.85ms. Allocated memory was 163.6MB in the beginning and 683.7MB in the end (delta: 520.1MB). Free memory was 78.1MB in the beginning and 506.4MB in the end (delta: -428.3MB). Peak memory consumption was 94.9MB. Max. memory is 8.0GB. [2025-04-26 18:39:30,863 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.14ms. Allocated memory is still 163.6MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.00ms. Allocated memory is still 163.6MB. Free memory was 91.8MB in the beginning and 90.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 17.62ms. Allocated memory is still 163.6MB. Free memory was 90.0MB in the beginning and 88.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 199.39ms. Allocated memory is still 163.6MB. Free memory was 88.8MB in the beginning and 78.1MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 6087.85ms. Allocated memory was 163.6MB in the beginning and 683.7MB in the end (delta: 520.1MB). Free memory was 78.1MB in the beginning and 506.4MB in the end (delta: -428.3MB). Peak memory consumption was 94.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 0.7s AutomataMinimizationTime, 4 MinimizatonAttempts, 3229 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.6s 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, 388 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 384 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: 38ms 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.8s InitialAbstraction: Time to compute Ample Reduction [ms]: 796, Number of transitions in reduction automaton: 5354, Number of states in reduction automaton: 2473, 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 18:39:30,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...