/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/max-tailsum5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:53:53,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:53:53,297 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:53:53,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:53:53,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:53:53,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:53:53,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:53:53,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:53:53,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:53:53,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:53:53,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:53:53,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:53:53,314 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:53:53,314 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:53:53,315 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:53:53,315 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:53:53,315 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:53:53,315 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:53:53,315 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:53:53,315 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:53:53,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:53:53,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:53:53,315 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:53:53,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:53:53,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:53:53,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:53:53,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:53:53,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:53:53,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:53:53,317 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:53:53,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:53:53,317 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:53:53,317 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:53:53,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:53:53,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:53:53,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:53,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:53:53,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:53:53,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:53:53,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:53:53,317 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:53:53,318 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:53:53,318 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:53:53,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:53:53,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:53:53,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:53:53,557 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:53:53,558 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:53:53,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum5.bpl [2025-04-26 16:53:53,561 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum5.bpl' [2025-04-26 16:53:53,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:53:53,580 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:53:53,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:53,581 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:53:53,581 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:53:53,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:53" (1/1) ... [2025-04-26 16:53:53,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:53" (1/1) ... [2025-04-26 16:53:53,616 INFO L138 Inliner]: procedures = 3, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:53:53,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:53,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:53:53,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:53:53,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:53:53,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:53" (1/1) ... [2025-04-26 16:53:53,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:53" (1/1) ... [2025-04-26 16:53:53,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:53" (1/1) ... [2025-04-26 16:53:53,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:53" (1/1) ... [2025-04-26 16:53:53,629 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:53" (1/1) ... [2025-04-26 16:53:53,629 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:53" (1/1) ... [2025-04-26 16:53:53,631 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:53" (1/1) ... [2025-04-26 16:53:53,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:53" (1/1) ... [2025-04-26 16:53:53,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:53" (1/1) ... [2025-04-26 16:53:53,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:53:53,647 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:53:53,647 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:53:53,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:53:53,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:53" (1/1) ... [2025-04-26 16:53:53,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:53,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:53,670 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:53,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:53:53,694 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:53:53,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:53:53,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:53:53,694 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2025-04-26 16:53:53,694 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2025-04-26 16:53:53,694 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2025-04-26 16:53:53,695 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:53:53,737 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:53:53,739 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:53:53,851 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:53:53,851 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:53:53,861 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:53:53,862 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:53:53,862 INFO L201 PluginConnector]: Adding new model max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:53 BoogieIcfgContainer [2025-04-26 16:53:53,862 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:53:53,863 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:53:53,863 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:53:53,867 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:53:53,868 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:53,868 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:53" (1/2) ... [2025-04-26 16:53:53,869 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5800adbc and model type max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:53:53, skipping insertion in model container [2025-04-26 16:53:53,869 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:53,869 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:53" (2/2) ... [2025-04-26 16:53:53,870 INFO L376 chiAutomizerObserver]: Analyzing ICFG max-tailsum5.bpl [2025-04-26 16:53:53,974 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 16:53:54,018 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:53:54,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:53:54,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:54,021 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:54,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:53:54,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 69 transitions, 173 flow [2025-04-26 16:53:54,127 INFO L116 PetriNetUnfolderBase]: 5/59 cut-off events. [2025-04-26 16:53:54,129 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 16:53:54,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 59 events. 5/59 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 178 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2025-04-26 16:53:54,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 69 transitions, 173 flow [2025-04-26 16:53:54,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 59 transitions, 148 flow [2025-04-26 16:53:54,138 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 70 places, 59 transitions, 148 flow [2025-04-26 16:53:54,147 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:53:54,891 WARN L140 AmpleReduction]: Number of pruned transitions: 8185 [2025-04-26 16:53:54,892 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:53:54,892 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 389 [2025-04-26 16:53:54,892 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:39 [2025-04-26 16:53:54,892 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:2915 [2025-04-26 16:53:54,892 WARN L145 AmpleReduction]: Times succ was already a loop node:234 [2025-04-26 16:53:54,892 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:826 [2025-04-26 16:53:54,892 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:53:54,906 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 3344 states, 3342 states have (on average 1.5314183123877918) internal successors, (in total 5118), 3343 states have internal predecessors, (5118), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:54,914 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:53:54,914 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:53:54,914 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:53:54,914 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:53:54,914 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:53:54,914 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:53:54,915 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:53:54,915 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:53:54,924 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3344 states, 3342 states have (on average 1.5314183123877918) internal successors, (in total 5118), 3343 states have internal predecessors, (5118), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:55,005 INFO L131 ngComponentsAnalysis]: Automaton has 392 accepting balls. 2745 [2025-04-26 16:53:55,006 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:55,006 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:55,011 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:53:55,011 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:53:55,011 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:53:55,017 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3344 states, 3342 states have (on average 1.5314183123877918) internal successors, (in total 5118), 3343 states have internal predecessors, (5118), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:55,060 INFO L131 ngComponentsAnalysis]: Automaton has 392 accepting balls. 2745 [2025-04-26 16:53:55,060 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:55,060 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:55,060 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:53:55,060 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:53:55,065 INFO L752 eck$LassoCheckResult]: Stem: "[47] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_ULTIMATE.start_k4_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= v_ULTIMATE.start_k4_1 v_N_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1, ULTIMATE.start_k4=v_ULTIMATE.start_k4_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1, ULTIMATE.start_k4=v_ULTIMATE.start_k4_1} AuxVars[] AssignedVars[]" "[97] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo]" "[50] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork0_x_1 0) InVars {} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_x]" "[51] L28-->L30: Formula: (= v_sumThread1of1ForFork0_z_1 0) InVars {} OutVars{sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_z]" "[52] L30-->L31-1: Formula: (= v_sumThread1of1ForFork0_i_1 v_sumThread1of1ForFork0_lo_1) InVars {sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_1} OutVars{sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_1, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_i]" [2025-04-26 16:53:55,066 INFO L754 eck$LassoCheckResult]: Loop: "[54] L31-1-->L32: Formula: (< v_sumThread1of1ForFork0_i_5 v_sumThread1of1ForFork0_hi_3) InVars {sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_5} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_5} AuxVars[] AssignedVars[]" "[56] L32-->L33: Formula: (= (+ v_sumThread1of1ForFork0_x_3 (select v_A_1 v_sumThread1of1ForFork0_i_7)) v_sumThread1of1ForFork0_x_4) InVars {A=v_A_1, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_7} OutVars{A=v_A_1, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_4, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_7} AuxVars[] AssignedVars[sumThread1of1ForFork0_x]" "[57] L33-->L34: Formula: (= (+ v_sumThread1of1ForFork0_i_9 1) v_sumThread1of1ForFork0_i_10) InVars {sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_9} OutVars{sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_10} AuxVars[] AssignedVars[sumThread1of1ForFork0_i]" "[58] L34-->L31-1: Formula: (= (let ((.cse0 (+ (select v_A_2 v_sumThread1of1ForFork0_i_13) v_sumThread1of1ForFork0_z_3))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork0_z_4) InVars {A=v_A_2, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_13} OutVars{A=v_A_2, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_4, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_13} AuxVars[] AssignedVars[sumThread1of1ForFork0_z]" [2025-04-26 16:53:55,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:55,074 INFO L85 PathProgramCache]: Analyzing trace with hash 74974048, now seen corresponding path program 1 times [2025-04-26 16:53:55,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:55,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958819226] [2025-04-26 16:53:55,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:55,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:55,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:53:55,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:53:55,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:55,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:55,137 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:55,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:53:55,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:53:55,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:55,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:55,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:55,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:55,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2587876, now seen corresponding path program 1 times [2025-04-26 16:53:55,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:55,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591939411] [2025-04-26 16:53:55,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:55,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:55,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:55,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:55,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:55,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:55,176 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:55,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:55,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:55,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:55,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:55,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:55,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:55,194 INFO L85 PathProgramCache]: Analyzing trace with hash 941668547, now seen corresponding path program 1 times [2025-04-26 16:53:55,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:55,194 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212288901] [2025-04-26 16:53:55,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:55,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:55,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:55,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:55,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:55,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:55,212 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:55,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:55,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:55,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:55,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:55,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:55,529 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:55,530 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:55,530 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:55,531 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:55,531 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:55,531 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:55,531 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:55,531 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:55,531 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-tailsum5.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:53:55,531 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:55,531 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:55,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,794 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:55,797 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:55,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:55,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:55,802 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:55,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:53:55,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:55,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:55,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:55,817 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:53:55,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:55,840 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:53:55,840 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:53:55,863 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:55,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:53:55,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:55,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:55,872 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:55,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:53:55,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:55,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:55,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:55,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:55,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:55,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:55,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:55,908 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:55,923 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:53:55,923 INFO L437 ModelExtractionUtils]: 8 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. [2025-04-26 16:53:55,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:55,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:55,948 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:55,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:53:55,955 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:55,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:55,972 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:55,972 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:55,972 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork0_hi, sumThread1of1ForFork0_i) = 1*sumThread1of1ForFork0_hi - 1*sumThread1of1ForFork0_i Supporting invariants [] [2025-04-26 16:53:55,979 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 16:53:55,982 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:56,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:56,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:53:56,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:53:56,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:56,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:56,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:56,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:56,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:56,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:56,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:56,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:56,126 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:53:56,132 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 3344 states, 3342 states have (on average 1.5314183123877918) internal successors, (in total 5118), 3343 states have internal predecessors, (5118), 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 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:56,323 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 3344 states, 3342 states have (on average 1.5314183123877918) internal successors, (in total 5118), 3343 states have internal predecessors, (5118), 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 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 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 7007 states and 10887 transitions. Complement of second has 6 states. [2025-04-26 16:53:56,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:56,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-04-26 16:53:56,330 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:53:56,331 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:56,331 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:53:56,331 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:56,331 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 5 letters. Loop has 8 letters. [2025-04-26 16:53:56,331 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:56,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7007 states and 10887 transitions. [2025-04-26 16:53:56,376 INFO L131 ngComponentsAnalysis]: Automaton has 338 accepting balls. 2112 [2025-04-26 16:53:56,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7007 states to 4257 states and 6422 transitions. [2025-04-26 16:53:56,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2724 [2025-04-26 16:53:56,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2930 [2025-04-26 16:53:56,416 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4257 states and 6422 transitions. [2025-04-26 16:53:56,417 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:56,417 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4257 states and 6422 transitions. [2025-04-26 16:53:56,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4257 states and 6422 transitions. [2025-04-26 16:53:56,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4257 to 4064. [2025-04-26 16:53:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4064 states, 4064 states have (on average 1.5054133858267718) internal successors, (in total 6118), 4063 states have internal predecessors, (6118), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4064 states to 4064 states and 6118 transitions. [2025-04-26 16:53:56,575 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4064 states and 6118 transitions. [2025-04-26 16:53:56,575 INFO L438 stractBuchiCegarLoop]: Abstraction has 4064 states and 6118 transitions. [2025-04-26 16:53:56,575 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:53:56,576 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4064 states and 6118 transitions. [2025-04-26 16:53:56,592 INFO L131 ngComponentsAnalysis]: Automaton has 338 accepting balls. 2112 [2025-04-26 16:53:56,592 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:56,592 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:56,593 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:56,593 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:53:56,594 INFO L752 eck$LassoCheckResult]: Stem: "[47] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_ULTIMATE.start_k4_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= v_ULTIMATE.start_k4_1 v_N_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1, ULTIMATE.start_k4=v_ULTIMATE.start_k4_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1, ULTIMATE.start_k4=v_ULTIMATE.start_k4_1} AuxVars[] AssignedVars[]" "[97] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo]" "[50] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork0_x_1 0) InVars {} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_x]" "[51] L28-->L30: Formula: (= v_sumThread1of1ForFork0_z_1 0) InVars {} OutVars{sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_z]" "[52] L30-->L31-1: Formula: (= v_sumThread1of1ForFork0_i_1 v_sumThread1of1ForFork0_lo_1) InVars {sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_1} OutVars{sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_1, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_i]" "[53] L31-1-->sumFINAL: Formula: (<= v_sumThread1of1ForFork0_hi_1 v_sumThread1of1ForFork0_i_3) InVars {sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_1, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_1, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_3} AuxVars[] AssignedVars[]" "[55] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[100] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= v_ULTIMATE.start_k2_3 v_sumThread1of1ForFork1_hi_6) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_16, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_8, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_hi, sumThread1of1ForFork1_z, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_thidvar1, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x, sumThread1of1ForFork1_lo]" "[77] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork1_x_1 0) InVars {} OutVars{sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_x]" "[78] L28-->L30: Formula: (= v_sumThread1of1ForFork1_z_1 0) InVars {} OutVars{sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_z]" "[79] L30-->L31-1: Formula: (= v_sumThread1of1ForFork1_i_1 v_sumThread1of1ForFork1_lo_1) InVars {sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_1} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_1, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_i]" [2025-04-26 16:53:56,594 INFO L754 eck$LassoCheckResult]: Loop: "[81] L31-1-->L32: Formula: (< v_sumThread1of1ForFork1_i_5 v_sumThread1of1ForFork1_hi_3) InVars {sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_5, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_3} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_5, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_3} AuxVars[] AssignedVars[]" "[83] L32-->L33: Formula: (= (+ (select v_A_1 v_sumThread1of1ForFork1_i_7) v_sumThread1of1ForFork1_x_3) v_sumThread1of1ForFork1_x_4) InVars {A=v_A_1, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_7, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_3} OutVars{A=v_A_1, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_7, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_x]" "[84] L33-->L34: Formula: (= (+ v_sumThread1of1ForFork1_i_9 1) v_sumThread1of1ForFork1_i_10) InVars {sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_9} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_10} AuxVars[] AssignedVars[sumThread1of1ForFork1_i]" "[85] L34-->L31-1: Formula: (= v_sumThread1of1ForFork1_z_4 (let ((.cse0 (+ (select v_A_2 v_sumThread1of1ForFork1_i_13) v_sumThread1of1ForFork1_z_3))) (ite (< 0 .cse0) .cse0 0))) InVars {A=v_A_2, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_13} OutVars{A=v_A_2, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_4, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_13} AuxVars[] AssignedVars[sumThread1of1ForFork1_z]" [2025-04-26 16:53:56,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:56,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1322876692, now seen corresponding path program 1 times [2025-04-26 16:53:56,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:56,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523380101] [2025-04-26 16:53:56,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:56,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:56,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:53:56,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:53:56,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:56,605 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:56,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:53:56,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:53:56,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:56,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:56,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:56,620 INFO L85 PathProgramCache]: Analyzing trace with hash 3419044, now seen corresponding path program 1 times [2025-04-26 16:53:56,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:56,620 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763849091] [2025-04-26 16:53:56,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:56,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:56,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:56,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:56,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:56,629 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:56,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:56,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:56,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:56,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:56,636 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:56,636 INFO L85 PathProgramCache]: Analyzing trace with hash -955629809, now seen corresponding path program 1 times [2025-04-26 16:53:56,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:56,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501724574] [2025-04-26 16:53:56,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:56,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:56,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:56,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:56,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:56,652 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:56,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:56,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:56,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:56,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:56,854 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:56,854 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:56,854 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:56,854 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:56,854 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:56,854 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,854 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:56,854 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:56,854 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-tailsum5.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:53:56,855 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:56,855 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:56,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:56,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:56,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:56,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:56,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:56,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:56,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:56,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:57,129 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:57,129 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:57,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:57,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:57,131 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:57,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:53:57,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:57,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:57,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:57,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:57,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:57,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:57,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:57,147 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:57,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:53:57,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:57,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:57,155 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:57,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:53:57,158 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:57,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:57,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:57,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:57,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:57,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:57,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:57,172 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:57,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:53:57,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:57,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:57,180 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:57,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:53:57,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:57,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:57,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:57,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:57,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:57,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:57,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:57,196 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:57,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:53:57,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:57,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:57,204 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:57,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:53:57,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:57,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:57,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:57,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:57,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:57,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:57,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:57,219 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:57,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:53:57,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:57,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:57,226 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:57,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:53:57,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:57,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:57,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:57,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:57,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:57,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:57,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:57,243 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:57,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:53:57,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:57,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:57,251 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:57,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:53:57,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:57,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:57,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:57,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:57,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:57,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:57,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:57,280 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:57,296 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:53:57,296 INFO L437 ModelExtractionUtils]: 9 out of 31 variables were initially zero. Simplification set additionally 19 variables to zero. [2025-04-26 16:53:57,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:57,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:57,298 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:57,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:53:57,301 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:57,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:53:57,317 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:57,317 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:57,317 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork1_hi, sumThread1of1ForFork1_i) = 1*sumThread1of1ForFork1_hi - 1*sumThread1of1ForFork1_i Supporting invariants [] [2025-04-26 16:53:57,323 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 16:53:57,324 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:57,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:57,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:53:57,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:53:57,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:57,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:57,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:57,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:57,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:57,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:57,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:57,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:57,395 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:53:57,395 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4064 states and 6118 transitions. cyclomatic complexity: 2497 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:57,539 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4064 states and 6118 transitions. cyclomatic complexity: 2497. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 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 8726 states and 13387 transitions. Complement of second has 6 states. [2025-04-26 16:53:57,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:57,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:57,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-04-26 16:53:57,540 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 117 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:53:57,541 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:57,541 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 117 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 16:53:57,541 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:57,541 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 117 transitions. Stem has 11 letters. Loop has 8 letters. [2025-04-26 16:53:57,541 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:57,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8726 states and 13387 transitions. [2025-04-26 16:53:57,589 INFO L131 ngComponentsAnalysis]: Automaton has 275 accepting balls. 1503 [2025-04-26 16:53:57,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8726 states to 5379 states and 8144 transitions. [2025-04-26 16:53:57,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2299 [2025-04-26 16:53:57,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2512 [2025-04-26 16:53:57,623 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5379 states and 8144 transitions. [2025-04-26 16:53:57,623 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:57,623 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5379 states and 8144 transitions. [2025-04-26 16:53:57,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states and 8144 transitions. [2025-04-26 16:53:57,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 5169. [2025-04-26 16:53:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5169 states, 5169 states have (on average 1.5147997678467788) internal successors, (in total 7830), 5168 states have internal predecessors, (7830), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:57,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5169 states to 5169 states and 7830 transitions. [2025-04-26 16:53:57,723 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5169 states and 7830 transitions. [2025-04-26 16:53:57,723 INFO L438 stractBuchiCegarLoop]: Abstraction has 5169 states and 7830 transitions. [2025-04-26 16:53:57,723 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:53:57,723 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5169 states and 7830 transitions. [2025-04-26 16:53:57,738 INFO L131 ngComponentsAnalysis]: Automaton has 275 accepting balls. 1503 [2025-04-26 16:53:57,738 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:57,738 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:57,739 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:57,739 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:53:57,739 INFO L752 eck$LassoCheckResult]: Stem: "[47] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_ULTIMATE.start_k4_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= v_ULTIMATE.start_k4_1 v_N_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1, ULTIMATE.start_k4=v_ULTIMATE.start_k4_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1, ULTIMATE.start_k4=v_ULTIMATE.start_k4_1} AuxVars[] AssignedVars[]" "[97] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo]" "[50] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork0_x_1 0) InVars {} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_x]" "[51] L28-->L30: Formula: (= v_sumThread1of1ForFork0_z_1 0) InVars {} OutVars{sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_z]" "[52] L30-->L31-1: Formula: (= v_sumThread1of1ForFork0_i_1 v_sumThread1of1ForFork0_lo_1) InVars {sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_1} OutVars{sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_1, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_i]" "[53] L31-1-->sumFINAL: Formula: (<= v_sumThread1of1ForFork0_hi_1 v_sumThread1of1ForFork0_i_3) InVars {sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_1, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_1, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_3} AuxVars[] AssignedVars[]" "[55] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[100] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= v_ULTIMATE.start_k2_3 v_sumThread1of1ForFork1_hi_6) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_16, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_8, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_hi, sumThread1of1ForFork1_z, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_thidvar1, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x, sumThread1of1ForFork1_lo]" "[77] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork1_x_1 0) InVars {} OutVars{sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_x]" "[78] L28-->L30: Formula: (= v_sumThread1of1ForFork1_z_1 0) InVars {} OutVars{sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_z]" "[79] L30-->L31-1: Formula: (= v_sumThread1of1ForFork1_i_1 v_sumThread1of1ForFork1_lo_1) InVars {sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_1} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_1, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_i]" "[80] L31-1-->sumFINAL: Formula: (<= v_sumThread1of1ForFork1_hi_1 v_sumThread1of1ForFork1_i_3) InVars {sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_3, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_1} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_3, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_1} AuxVars[] AssignedVars[]" "[82] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[103] L55-->$Ultimate##0: Formula: (and (= 3 v_sumThread1of1ForFork2_thidvar1_2) (= 3 v_sumThread1of1ForFork2_thidvar0_2) (= 3 v_sumThread1of1ForFork2_thidvar2_2) (= v_ULTIMATE.start_k3_3 v_sumThread1of1ForFork2_hi_6) (= v_sumThread1of1ForFork2_lo_4 (+ v_ULTIMATE.start_k2_5 1))) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_3, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5} OutVars{sumThread1of1ForFork2_thidvar0=v_sumThread1of1ForFork2_thidvar0_2, sumThread1of1ForFork2_thidvar1=v_sumThread1of1ForFork2_thidvar1_2, sumThread1of1ForFork2_thidvar2=v_sumThread1of1ForFork2_thidvar2_2, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_8, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_16, ULTIMATE.start_k3=v_ULTIMATE.start_k3_3, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_8, sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_4, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_6} AuxVars[] AssignedVars[sumThread1of1ForFork2_thidvar0, sumThread1of1ForFork2_thidvar1, sumThread1of1ForFork2_thidvar2, sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x, sumThread1of1ForFork2_lo, sumThread1of1ForFork2_hi]" "[86] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork2_x_1 0) InVars {} OutVars{sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork2_x]" "[87] L28-->L30: Formula: (= v_sumThread1of1ForFork2_z_1 0) InVars {} OutVars{sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork2_z]" "[88] L30-->L31-1: Formula: (= v_sumThread1of1ForFork2_i_1 v_sumThread1of1ForFork2_lo_1) InVars {sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_1} OutVars{sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_1, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_1} AuxVars[] AssignedVars[sumThread1of1ForFork2_i]" [2025-04-26 16:53:57,740 INFO L754 eck$LassoCheckResult]: Loop: "[90] L31-1-->L32: Formula: (< v_sumThread1of1ForFork2_i_5 v_sumThread1of1ForFork2_hi_3) InVars {sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_3, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_5} OutVars{sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_3, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[92] L32-->L33: Formula: (= v_sumThread1of1ForFork2_x_4 (+ (select v_A_1 v_sumThread1of1ForFork2_i_7) v_sumThread1of1ForFork2_x_3)) InVars {A=v_A_1, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_7, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_3} OutVars{A=v_A_1, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_7, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_4} AuxVars[] AssignedVars[sumThread1of1ForFork2_x]" "[93] L33-->L34: Formula: (= (+ v_sumThread1of1ForFork2_i_9 1) v_sumThread1of1ForFork2_i_10) InVars {sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_9} OutVars{sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_10} AuxVars[] AssignedVars[sumThread1of1ForFork2_i]" "[94] L34-->L31-1: Formula: (= v_sumThread1of1ForFork2_z_4 (let ((.cse0 (+ (select v_A_2 v_sumThread1of1ForFork2_i_13) v_sumThread1of1ForFork2_z_3))) (ite (< 0 .cse0) .cse0 0))) InVars {A=v_A_2, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_3, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_13} OutVars{A=v_A_2, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_4, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_13} AuxVars[] AssignedVars[sumThread1of1ForFork2_z]" [2025-04-26 16:53:57,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:57,741 INFO L85 PathProgramCache]: Analyzing trace with hash 733771998, now seen corresponding path program 1 times [2025-04-26 16:53:57,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:57,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331525889] [2025-04-26 16:53:57,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:57,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:57,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:53:57,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:53:57,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:57,753 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:57,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:53:57,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:53:57,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:57,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:57,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:57,763 INFO L85 PathProgramCache]: Analyzing trace with hash 3696100, now seen corresponding path program 1 times [2025-04-26 16:53:57,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:57,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112433681] [2025-04-26 16:53:57,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:57,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:57,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:57,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:57,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:57,787 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:57,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:57,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:57,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:57,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:57,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:57,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1792858047, now seen corresponding path program 1 times [2025-04-26 16:53:57,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:57,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924064393] [2025-04-26 16:53:57,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:57,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:57,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:53:57,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:53:57,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:57,805 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:57,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:53:57,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:53:57,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:57,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:58,096 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:58,096 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:58,096 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:58,096 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:58,096 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:58,096 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,096 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:58,096 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:58,096 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-tailsum5.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:53:58,096 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:58,096 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:58,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,431 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:58,431 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:58,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,435 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:53:58,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:58,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:58,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:58,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:58,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:58,447 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:58,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:58,450 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:58,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:53:58,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,460 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:53:58,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:58,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:58,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:58,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:58,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:58,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:58,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:58,476 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:58,482 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 16:53:58,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,484 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:53:58,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:58,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:58,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:58,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:58,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:58,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:58,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:58,501 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:58,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:58,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,509 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:53:58,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:58,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:58,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:58,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:58,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:58,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:58,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:58,526 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:58,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:58,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,543 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:53:58,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:58,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:58,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:58,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:58,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:58,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:58,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:58,561 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:58,566 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 16:53:58,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,569 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:53:58,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 16:53:58,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:58,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:58,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:58,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:58,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:58,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:58,585 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:58,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:58,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,594 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:53:58,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:58,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:58,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:58,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:58,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:58,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:58,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:58,610 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:58,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:53:58,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,617 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:53:58,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:58,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:58,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:58,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:58,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:58,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:58,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:58,636 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:58,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:53:58,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,644 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:53:58,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:58,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:58,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:58,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:58,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:58,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:58,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:58,660 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:58,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:53:58,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,668 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:53:58,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:58,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:58,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:58,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:58,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:58,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:58,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:58,684 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:58,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:58,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,693 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:53:58,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:58,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:58,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:58,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:58,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:58,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:58,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:58,709 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:58,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:53:58,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,717 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:53:58,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:58,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:58,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:58,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:58,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:58,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:58,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:58,743 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:58,755 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:53:58,755 INFO L437 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:53:58,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,757 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:53:58,760 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:58,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:53:58,779 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:58,779 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:58,779 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork2_i, sumThread1of1ForFork2_hi) = -1*sumThread1of1ForFork2_i + 1*sumThread1of1ForFork2_hi Supporting invariants [] [2025-04-26 16:53:58,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:53:58,789 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:58,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:58,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:53:58,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:53:58,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:58,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:58,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:58,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:58,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:58,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:58,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:58,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:58,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:58,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:58,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:58,884 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:53:58,885 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5169 states and 7830 transitions. cyclomatic complexity: 3166 Second operand has 4 states, 4 states have (on average 5.25) internal successors, (in total 21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:59,007 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5169 states and 7830 transitions. cyclomatic complexity: 3166. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (in total 21), 4 states have internal predecessors, (21), 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 12283 states and 19048 transitions. Complement of second has 6 states. [2025-04-26 16:53:59,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (in total 21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:59,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-04-26 16:53:59,009 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 120 transitions. Stem has 17 letters. Loop has 4 letters. [2025-04-26 16:53:59,009 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:59,009 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 120 transitions. Stem has 21 letters. Loop has 4 letters. [2025-04-26 16:53:59,009 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:59,009 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 120 transitions. Stem has 17 letters. Loop has 8 letters. [2025-04-26 16:53:59,009 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:59,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12283 states and 19048 transitions. [2025-04-26 16:53:59,098 INFO L131 ngComponentsAnalysis]: Automaton has 188 accepting balls. 888 [2025-04-26 16:53:59,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12283 states to 6748 states and 10362 transitions. [2025-04-26 16:53:59,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1822 [2025-04-26 16:53:59,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2016 [2025-04-26 16:53:59,140 INFO L74 IsDeterministic]: Start isDeterministic. Operand 6748 states and 10362 transitions. [2025-04-26 16:53:59,141 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:59,141 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6748 states and 10362 transitions. [2025-04-26 16:53:59,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6748 states and 10362 transitions. [2025-04-26 16:53:59,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6748 to 6485. [2025-04-26 16:53:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6485 states, 6485 states have (on average 1.5429452582883578) internal successors, (in total 10006), 6484 states have internal predecessors, (10006), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6485 states to 6485 states and 10006 transitions. [2025-04-26 16:53:59,255 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6485 states and 10006 transitions. [2025-04-26 16:53:59,255 INFO L438 stractBuchiCegarLoop]: Abstraction has 6485 states and 10006 transitions. [2025-04-26 16:53:59,256 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:53:59,256 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6485 states and 10006 transitions. [2025-04-26 16:53:59,273 INFO L131 ngComponentsAnalysis]: Automaton has 188 accepting balls. 888 [2025-04-26 16:53:59,273 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:59,273 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:59,274 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:59,274 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:53:59,274 INFO L752 eck$LassoCheckResult]: Stem: "[47] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_ULTIMATE.start_k4_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= v_ULTIMATE.start_k4_1 v_N_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1, ULTIMATE.start_k4=v_ULTIMATE.start_k4_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1, ULTIMATE.start_k4=v_ULTIMATE.start_k4_1} AuxVars[] AssignedVars[]" "[97] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo]" "[50] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork0_x_1 0) InVars {} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_x]" "[51] L28-->L30: Formula: (= v_sumThread1of1ForFork0_z_1 0) InVars {} OutVars{sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_z]" "[52] L30-->L31-1: Formula: (= v_sumThread1of1ForFork0_i_1 v_sumThread1of1ForFork0_lo_1) InVars {sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_1} OutVars{sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_1, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_i]" "[53] L31-1-->sumFINAL: Formula: (<= v_sumThread1of1ForFork0_hi_1 v_sumThread1of1ForFork0_i_3) InVars {sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_1, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_1, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_3} AuxVars[] AssignedVars[]" "[55] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[100] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= v_ULTIMATE.start_k2_3 v_sumThread1of1ForFork1_hi_6) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_16, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_8, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_hi, sumThread1of1ForFork1_z, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_thidvar1, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x, sumThread1of1ForFork1_lo]" "[77] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork1_x_1 0) InVars {} OutVars{sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_x]" "[78] L28-->L30: Formula: (= v_sumThread1of1ForFork1_z_1 0) InVars {} OutVars{sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_z]" "[79] L30-->L31-1: Formula: (= v_sumThread1of1ForFork1_i_1 v_sumThread1of1ForFork1_lo_1) InVars {sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_1} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_1, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_i]" "[80] L31-1-->sumFINAL: Formula: (<= v_sumThread1of1ForFork1_hi_1 v_sumThread1of1ForFork1_i_3) InVars {sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_3, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_1} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_3, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_1} AuxVars[] AssignedVars[]" "[82] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[103] L55-->$Ultimate##0: Formula: (and (= 3 v_sumThread1of1ForFork2_thidvar1_2) (= 3 v_sumThread1of1ForFork2_thidvar0_2) (= 3 v_sumThread1of1ForFork2_thidvar2_2) (= v_ULTIMATE.start_k3_3 v_sumThread1of1ForFork2_hi_6) (= v_sumThread1of1ForFork2_lo_4 (+ v_ULTIMATE.start_k2_5 1))) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_3, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5} OutVars{sumThread1of1ForFork2_thidvar0=v_sumThread1of1ForFork2_thidvar0_2, sumThread1of1ForFork2_thidvar1=v_sumThread1of1ForFork2_thidvar1_2, sumThread1of1ForFork2_thidvar2=v_sumThread1of1ForFork2_thidvar2_2, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_8, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_16, ULTIMATE.start_k3=v_ULTIMATE.start_k3_3, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_8, sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_4, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_6} AuxVars[] AssignedVars[sumThread1of1ForFork2_thidvar0, sumThread1of1ForFork2_thidvar1, sumThread1of1ForFork2_thidvar2, sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x, sumThread1of1ForFork2_lo, sumThread1of1ForFork2_hi]" "[86] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork2_x_1 0) InVars {} OutVars{sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork2_x]" "[87] L28-->L30: Formula: (= v_sumThread1of1ForFork2_z_1 0) InVars {} OutVars{sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork2_z]" "[88] L30-->L31-1: Formula: (= v_sumThread1of1ForFork2_i_1 v_sumThread1of1ForFork2_lo_1) InVars {sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_1} OutVars{sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_1, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_1} AuxVars[] AssignedVars[sumThread1of1ForFork2_i]" "[89] L31-1-->sumFINAL: Formula: (<= v_sumThread1of1ForFork2_hi_1 v_sumThread1of1ForFork2_i_3) InVars {sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_1, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_3} OutVars{sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_1, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[91] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[106] L56-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k3_5 1) v_sumThread1of1ForFork3_lo_4) (= v_ULTIMATE.start_k4_3 v_sumThread1of1ForFork3_hi_6) (= v_sumThread1of1ForFork3_thidvar1_2 4) (= v_sumThread1of1ForFork3_thidvar2_2 4) (= v_sumThread1of1ForFork3_thidvar0_2 4) (= v_sumThread1of1ForFork3_thidvar3_2 4)) InVars {ULTIMATE.start_k4=v_ULTIMATE.start_k4_3, ULTIMATE.start_k3=v_ULTIMATE.start_k3_5} OutVars{sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_16, sumThread1of1ForFork3_thidvar0=v_sumThread1of1ForFork3_thidvar0_2, sumThread1of1ForFork3_x=v_sumThread1of1ForFork3_x_8, sumThread1of1ForFork3_z=v_sumThread1of1ForFork3_z_8, ULTIMATE.start_k4=v_ULTIMATE.start_k4_3, ULTIMATE.start_k3=v_ULTIMATE.start_k3_5, sumThread1of1ForFork3_thidvar3=v_sumThread1of1ForFork3_thidvar3_2, sumThread1of1ForFork3_thidvar2=v_sumThread1of1ForFork3_thidvar2_2, sumThread1of1ForFork3_thidvar1=v_sumThread1of1ForFork3_thidvar1_2, sumThread1of1ForFork3_lo=v_sumThread1of1ForFork3_lo_4, sumThread1of1ForFork3_hi=v_sumThread1of1ForFork3_hi_6} AuxVars[] AssignedVars[sumThread1of1ForFork3_i, sumThread1of1ForFork3_thidvar0, sumThread1of1ForFork3_x, sumThread1of1ForFork3_z, sumThread1of1ForFork3_thidvar3, sumThread1of1ForFork3_thidvar2, sumThread1of1ForFork3_thidvar1, sumThread1of1ForFork3_lo, sumThread1of1ForFork3_hi]" "[59] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork3_x_1 0) InVars {} OutVars{sumThread1of1ForFork3_x=v_sumThread1of1ForFork3_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork3_x]" "[60] L28-->L30: Formula: (= v_sumThread1of1ForFork3_z_1 0) InVars {} OutVars{sumThread1of1ForFork3_z=v_sumThread1of1ForFork3_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork3_z]" "[61] L30-->L31-1: Formula: (= v_sumThread1of1ForFork3_i_1 v_sumThread1of1ForFork3_lo_1) InVars {sumThread1of1ForFork3_lo=v_sumThread1of1ForFork3_lo_1} OutVars{sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_1, sumThread1of1ForFork3_lo=v_sumThread1of1ForFork3_lo_1} AuxVars[] AssignedVars[sumThread1of1ForFork3_i]" [2025-04-26 16:53:59,275 INFO L754 eck$LassoCheckResult]: Loop: "[63] L31-1-->L32: Formula: (< v_sumThread1of1ForFork3_i_5 v_sumThread1of1ForFork3_hi_3) InVars {sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_5, sumThread1of1ForFork3_hi=v_sumThread1of1ForFork3_hi_3} OutVars{sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_5, sumThread1of1ForFork3_hi=v_sumThread1of1ForFork3_hi_3} AuxVars[] AssignedVars[]" "[65] L32-->L33: Formula: (= (+ (select v_A_1 v_sumThread1of1ForFork3_i_7) v_sumThread1of1ForFork3_x_3) v_sumThread1of1ForFork3_x_4) InVars {A=v_A_1, sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_7, sumThread1of1ForFork3_x=v_sumThread1of1ForFork3_x_3} OutVars{A=v_A_1, sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_7, sumThread1of1ForFork3_x=v_sumThread1of1ForFork3_x_4} AuxVars[] AssignedVars[sumThread1of1ForFork3_x]" "[66] L33-->L34: Formula: (= (+ v_sumThread1of1ForFork3_i_9 1) v_sumThread1of1ForFork3_i_10) InVars {sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_9} OutVars{sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_10} AuxVars[] AssignedVars[sumThread1of1ForFork3_i]" "[67] L34-->L31-1: Formula: (= v_sumThread1of1ForFork3_z_4 (let ((.cse0 (+ v_sumThread1of1ForFork3_z_3 (select v_A_2 v_sumThread1of1ForFork3_i_13)))) (ite (< 0 .cse0) .cse0 0))) InVars {A=v_A_2, sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_13, sumThread1of1ForFork3_z=v_sumThread1of1ForFork3_z_3} OutVars{A=v_A_2, sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_13, sumThread1of1ForFork3_z=v_sumThread1of1ForFork3_z_4} AuxVars[] AssignedVars[sumThread1of1ForFork3_z]" [2025-04-26 16:53:59,275 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:59,275 INFO L85 PathProgramCache]: Analyzing trace with hash -683894574, now seen corresponding path program 1 times [2025-04-26 16:53:59,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:59,275 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915171700] [2025-04-26 16:53:59,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:59,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:59,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:53:59,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:53:59,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:59,285 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:59,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:53:59,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:53:59,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:59,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:59,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:59,295 INFO L85 PathProgramCache]: Analyzing trace with hash 2864932, now seen corresponding path program 1 times [2025-04-26 16:53:59,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:59,295 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954886851] [2025-04-26 16:53:59,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:59,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:59,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:59,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:59,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:59,299 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:59,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:59,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:59,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:59,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:59,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:59,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1121812341, now seen corresponding path program 1 times [2025-04-26 16:53:59,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:59,303 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656897571] [2025-04-26 16:53:59,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:59,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:59,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:53:59,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:53:59,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:59,310 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:59,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:53:59,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:53:59,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:59,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:59,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:59,672 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:59,672 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:59,672 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:59,672 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:59,672 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:59,672 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:59,672 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:59,672 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:59,672 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-tailsum5.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:53:59,672 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:59,672 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:59,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:59,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:00,086 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:00,086 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:00,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:00,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:00,088 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:00,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:54:00,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:00,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:00,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:00,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:00,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:00,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:00,103 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:00,105 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:00,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:00,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:00,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:00,114 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:00,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:54:00,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:00,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:00,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:00,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:00,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:00,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:00,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:00,131 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:00,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:54:00,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:00,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:00,138 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:00,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:54:00,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:00,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:00,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:00,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:00,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:00,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:00,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:00,153 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:00,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:54:00,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:00,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:00,160 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:00,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:54:00,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:00,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:00,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:00,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:00,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:00,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:00,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:00,191 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:00,206 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:54:00,206 INFO L437 ModelExtractionUtils]: 15 out of 49 variables were initially zero. Simplification set additionally 31 variables to zero. [2025-04-26 16:54:00,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:00,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:00,208 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:00,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:54:00,211 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:00,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 16:54:00,226 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:00,226 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:00,226 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork3_i, sumThread1of1ForFork3_hi) = -1*sumThread1of1ForFork3_i + 1*sumThread1of1ForFork3_hi Supporting invariants [] [2025-04-26 16:54:00,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:54:00,233 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:00,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:00,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:54:00,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:54:00,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:00,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:00,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:00,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:00,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:00,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:00,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:00,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:00,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:00,303 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:54:00,304 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6485 states and 10006 transitions. cyclomatic complexity: 4076 Second operand has 4 states, 4 states have (on average 6.75) internal successors, (in total 27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:00,411 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6485 states and 10006 transitions. cyclomatic complexity: 4076. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (in total 27), 4 states have internal predecessors, (27), 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 15588 states and 24893 transitions. Complement of second has 6 states. [2025-04-26 16:54:00,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (in total 27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2025-04-26 16:54:00,413 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 125 transitions. Stem has 23 letters. Loop has 4 letters. [2025-04-26 16:54:00,413 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:00,413 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 125 transitions. Stem has 27 letters. Loop has 4 letters. [2025-04-26 16:54:00,413 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:00,413 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 125 transitions. Stem has 23 letters. Loop has 8 letters. [2025-04-26 16:54:00,413 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:00,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15588 states and 24893 transitions. [2025-04-26 16:54:00,539 INFO L131 ngComponentsAnalysis]: Automaton has 85 accepting balls. 340 [2025-04-26 16:54:00,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15588 states to 7403 states and 11969 transitions. [2025-04-26 16:54:00,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1302 [2025-04-26 16:54:00,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2025-04-26 16:54:00,578 INFO L74 IsDeterministic]: Start isDeterministic. Operand 7403 states and 11969 transitions. [2025-04-26 16:54:00,578 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:00,578 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7403 states and 11969 transitions. [2025-04-26 16:54:00,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7403 states and 11969 transitions. [2025-04-26 16:54:00,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7403 to 7143. [2025-04-26 16:54:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7143 states, 7143 states have (on average 1.6280274394512109) internal successors, (in total 11629), 7142 states have internal predecessors, (11629), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:00,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7143 states to 7143 states and 11629 transitions. [2025-04-26 16:54:00,690 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7143 states and 11629 transitions. [2025-04-26 16:54:00,690 INFO L438 stractBuchiCegarLoop]: Abstraction has 7143 states and 11629 transitions. [2025-04-26 16:54:00,690 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:54:00,690 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7143 states and 11629 transitions. [2025-04-26 16:54:00,710 INFO L131 ngComponentsAnalysis]: Automaton has 85 accepting balls. 340 [2025-04-26 16:54:00,710 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:00,710 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:00,711 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:00,711 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:54:00,712 INFO L752 eck$LassoCheckResult]: Stem: "[47] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_ULTIMATE.start_k4_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= v_ULTIMATE.start_k4_1 v_N_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1, ULTIMATE.start_k4=v_ULTIMATE.start_k4_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1, ULTIMATE.start_k4=v_ULTIMATE.start_k4_1} AuxVars[] AssignedVars[]" "[97] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo]" "[50] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork0_x_1 0) InVars {} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_x]" "[51] L28-->L30: Formula: (= v_sumThread1of1ForFork0_z_1 0) InVars {} OutVars{sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_z]" "[52] L30-->L31-1: Formula: (= v_sumThread1of1ForFork0_i_1 v_sumThread1of1ForFork0_lo_1) InVars {sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_1} OutVars{sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_1, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_i]" "[53] L31-1-->sumFINAL: Formula: (<= v_sumThread1of1ForFork0_hi_1 v_sumThread1of1ForFork0_i_3) InVars {sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_1, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_1, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_3} AuxVars[] AssignedVars[]" "[55] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[100] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= v_ULTIMATE.start_k2_3 v_sumThread1of1ForFork1_hi_6) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_16, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_8, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_hi, sumThread1of1ForFork1_z, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_thidvar1, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x, sumThread1of1ForFork1_lo]" "[77] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork1_x_1 0) InVars {} OutVars{sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_x]" "[78] L28-->L30: Formula: (= v_sumThread1of1ForFork1_z_1 0) InVars {} OutVars{sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_z]" "[79] L30-->L31-1: Formula: (= v_sumThread1of1ForFork1_i_1 v_sumThread1of1ForFork1_lo_1) InVars {sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_1} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_1, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_i]" "[80] L31-1-->sumFINAL: Formula: (<= v_sumThread1of1ForFork1_hi_1 v_sumThread1of1ForFork1_i_3) InVars {sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_3, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_1} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_3, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_1} AuxVars[] AssignedVars[]" "[82] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[103] L55-->$Ultimate##0: Formula: (and (= 3 v_sumThread1of1ForFork2_thidvar1_2) (= 3 v_sumThread1of1ForFork2_thidvar0_2) (= 3 v_sumThread1of1ForFork2_thidvar2_2) (= v_ULTIMATE.start_k3_3 v_sumThread1of1ForFork2_hi_6) (= v_sumThread1of1ForFork2_lo_4 (+ v_ULTIMATE.start_k2_5 1))) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_3, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5} OutVars{sumThread1of1ForFork2_thidvar0=v_sumThread1of1ForFork2_thidvar0_2, sumThread1of1ForFork2_thidvar1=v_sumThread1of1ForFork2_thidvar1_2, sumThread1of1ForFork2_thidvar2=v_sumThread1of1ForFork2_thidvar2_2, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_8, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_16, ULTIMATE.start_k3=v_ULTIMATE.start_k3_3, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_8, sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_4, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_6} AuxVars[] AssignedVars[sumThread1of1ForFork2_thidvar0, sumThread1of1ForFork2_thidvar1, sumThread1of1ForFork2_thidvar2, sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x, sumThread1of1ForFork2_lo, sumThread1of1ForFork2_hi]" "[86] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork2_x_1 0) InVars {} OutVars{sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork2_x]" "[87] L28-->L30: Formula: (= v_sumThread1of1ForFork2_z_1 0) InVars {} OutVars{sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork2_z]" "[88] L30-->L31-1: Formula: (= v_sumThread1of1ForFork2_i_1 v_sumThread1of1ForFork2_lo_1) InVars {sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_1} OutVars{sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_1, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_1} AuxVars[] AssignedVars[sumThread1of1ForFork2_i]" "[89] L31-1-->sumFINAL: Formula: (<= v_sumThread1of1ForFork2_hi_1 v_sumThread1of1ForFork2_i_3) InVars {sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_1, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_3} OutVars{sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_1, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_3} AuxVars[] AssignedVars[]" "[91] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[106] L56-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k3_5 1) v_sumThread1of1ForFork3_lo_4) (= v_ULTIMATE.start_k4_3 v_sumThread1of1ForFork3_hi_6) (= v_sumThread1of1ForFork3_thidvar1_2 4) (= v_sumThread1of1ForFork3_thidvar2_2 4) (= v_sumThread1of1ForFork3_thidvar0_2 4) (= v_sumThread1of1ForFork3_thidvar3_2 4)) InVars {ULTIMATE.start_k4=v_ULTIMATE.start_k4_3, ULTIMATE.start_k3=v_ULTIMATE.start_k3_5} OutVars{sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_16, sumThread1of1ForFork3_thidvar0=v_sumThread1of1ForFork3_thidvar0_2, sumThread1of1ForFork3_x=v_sumThread1of1ForFork3_x_8, sumThread1of1ForFork3_z=v_sumThread1of1ForFork3_z_8, ULTIMATE.start_k4=v_ULTIMATE.start_k4_3, ULTIMATE.start_k3=v_ULTIMATE.start_k3_5, sumThread1of1ForFork3_thidvar3=v_sumThread1of1ForFork3_thidvar3_2, sumThread1of1ForFork3_thidvar2=v_sumThread1of1ForFork3_thidvar2_2, sumThread1of1ForFork3_thidvar1=v_sumThread1of1ForFork3_thidvar1_2, sumThread1of1ForFork3_lo=v_sumThread1of1ForFork3_lo_4, sumThread1of1ForFork3_hi=v_sumThread1of1ForFork3_hi_6} AuxVars[] AssignedVars[sumThread1of1ForFork3_i, sumThread1of1ForFork3_thidvar0, sumThread1of1ForFork3_x, sumThread1of1ForFork3_z, sumThread1of1ForFork3_thidvar3, sumThread1of1ForFork3_thidvar2, sumThread1of1ForFork3_thidvar1, sumThread1of1ForFork3_lo, sumThread1of1ForFork3_hi]" "[59] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork3_x_1 0) InVars {} OutVars{sumThread1of1ForFork3_x=v_sumThread1of1ForFork3_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork3_x]" "[60] L28-->L30: Formula: (= v_sumThread1of1ForFork3_z_1 0) InVars {} OutVars{sumThread1of1ForFork3_z=v_sumThread1of1ForFork3_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork3_z]" "[61] L30-->L31-1: Formula: (= v_sumThread1of1ForFork3_i_1 v_sumThread1of1ForFork3_lo_1) InVars {sumThread1of1ForFork3_lo=v_sumThread1of1ForFork3_lo_1} OutVars{sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_1, sumThread1of1ForFork3_lo=v_sumThread1of1ForFork3_lo_1} AuxVars[] AssignedVars[sumThread1of1ForFork3_i]" "[62] L31-1-->sumFINAL: Formula: (<= v_sumThread1of1ForFork3_hi_1 v_sumThread1of1ForFork3_i_3) InVars {sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_3, sumThread1of1ForFork3_hi=v_sumThread1of1ForFork3_hi_1} OutVars{sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_3, sumThread1of1ForFork3_hi=v_sumThread1of1ForFork3_hi_1} AuxVars[] AssignedVars[]" "[64] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[109] L57-->$Ultimate##0: Formula: (and (= v_N_3 v_sumThread1of1ForFork4_hi_6) (= 5 v_sumThread1of1ForFork4_thidvar4_2) (= (+ v_ULTIMATE.start_k4_5 1) v_sumThread1of1ForFork4_lo_4) (= 5 v_sumThread1of1ForFork4_thidvar3_2) (= 5 v_sumThread1of1ForFork4_thidvar0_2) (= 5 v_sumThread1of1ForFork4_thidvar2_2) (= 5 v_sumThread1of1ForFork4_thidvar1_2)) InVars {N=v_N_3, ULTIMATE.start_k4=v_ULTIMATE.start_k4_5} OutVars{N=v_N_3, sumThread1of1ForFork4_x=v_sumThread1of1ForFork4_x_8, sumThread1of1ForFork4_thidvar4=v_sumThread1of1ForFork4_thidvar4_2, sumThread1of1ForFork4_z=v_sumThread1of1ForFork4_z_8, sumThread1of1ForFork4_thidvar2=v_sumThread1of1ForFork4_thidvar2_2, sumThread1of1ForFork4_i=v_sumThread1of1ForFork4_i_16, sumThread1of1ForFork4_thidvar3=v_sumThread1of1ForFork4_thidvar3_2, ULTIMATE.start_k4=v_ULTIMATE.start_k4_5, sumThread1of1ForFork4_thidvar0=v_sumThread1of1ForFork4_thidvar0_2, sumThread1of1ForFork4_thidvar1=v_sumThread1of1ForFork4_thidvar1_2, sumThread1of1ForFork4_lo=v_sumThread1of1ForFork4_lo_4, sumThread1of1ForFork4_hi=v_sumThread1of1ForFork4_hi_6} AuxVars[] AssignedVars[sumThread1of1ForFork4_x, sumThread1of1ForFork4_thidvar4, sumThread1of1ForFork4_z, sumThread1of1ForFork4_thidvar2, sumThread1of1ForFork4_i, sumThread1of1ForFork4_thidvar3, sumThread1of1ForFork4_thidvar0, sumThread1of1ForFork4_thidvar1, sumThread1of1ForFork4_lo, sumThread1of1ForFork4_hi]" "[68] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork4_x_1 0) InVars {} OutVars{sumThread1of1ForFork4_x=v_sumThread1of1ForFork4_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork4_x]" "[69] L28-->L30: Formula: (= v_sumThread1of1ForFork4_z_1 0) InVars {} OutVars{sumThread1of1ForFork4_z=v_sumThread1of1ForFork4_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork4_z]" "[70] L30-->L31-1: Formula: (= v_sumThread1of1ForFork4_i_1 v_sumThread1of1ForFork4_lo_1) InVars {sumThread1of1ForFork4_lo=v_sumThread1of1ForFork4_lo_1} OutVars{sumThread1of1ForFork4_lo=v_sumThread1of1ForFork4_lo_1, sumThread1of1ForFork4_i=v_sumThread1of1ForFork4_i_1} AuxVars[] AssignedVars[sumThread1of1ForFork4_i]" [2025-04-26 16:54:00,712 INFO L754 eck$LassoCheckResult]: Loop: "[72] L31-1-->L32: Formula: (< v_sumThread1of1ForFork4_i_5 v_sumThread1of1ForFork4_hi_3) InVars {sumThread1of1ForFork4_hi=v_sumThread1of1ForFork4_hi_3, sumThread1of1ForFork4_i=v_sumThread1of1ForFork4_i_5} OutVars{sumThread1of1ForFork4_hi=v_sumThread1of1ForFork4_hi_3, sumThread1of1ForFork4_i=v_sumThread1of1ForFork4_i_5} AuxVars[] AssignedVars[]" "[74] L32-->L33: Formula: (= v_sumThread1of1ForFork4_x_4 (+ v_sumThread1of1ForFork4_x_3 (select v_A_1 v_sumThread1of1ForFork4_i_7))) InVars {A=v_A_1, sumThread1of1ForFork4_x=v_sumThread1of1ForFork4_x_3, sumThread1of1ForFork4_i=v_sumThread1of1ForFork4_i_7} OutVars{A=v_A_1, sumThread1of1ForFork4_x=v_sumThread1of1ForFork4_x_4, sumThread1of1ForFork4_i=v_sumThread1of1ForFork4_i_7} AuxVars[] AssignedVars[sumThread1of1ForFork4_x]" "[75] L33-->L34: Formula: (= (+ v_sumThread1of1ForFork4_i_9 1) v_sumThread1of1ForFork4_i_10) InVars {sumThread1of1ForFork4_i=v_sumThread1of1ForFork4_i_9} OutVars{sumThread1of1ForFork4_i=v_sumThread1of1ForFork4_i_10} AuxVars[] AssignedVars[sumThread1of1ForFork4_i]" "[76] L34-->L31-1: Formula: (= (let ((.cse0 (+ (select v_A_2 v_sumThread1of1ForFork4_i_13) v_sumThread1of1ForFork4_z_3))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork4_z_4) InVars {A=v_A_2, sumThread1of1ForFork4_z=v_sumThread1of1ForFork4_z_3, sumThread1of1ForFork4_i=v_sumThread1of1ForFork4_i_13} OutVars{A=v_A_2, sumThread1of1ForFork4_z=v_sumThread1of1ForFork4_z_4, sumThread1of1ForFork4_i=v_sumThread1of1ForFork4_i_13} AuxVars[] AssignedVars[sumThread1of1ForFork4_z]" [2025-04-26 16:54:00,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:00,712 INFO L85 PathProgramCache]: Analyzing trace with hash -3400084, now seen corresponding path program 1 times [2025-04-26 16:54:00,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:00,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874315619] [2025-04-26 16:54:00,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:00,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:00,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:54:00,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:54:00,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:00,723 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:00,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:54:00,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:54:00,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:00,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:00,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:00,743 INFO L85 PathProgramCache]: Analyzing trace with hash 3141988, now seen corresponding path program 1 times [2025-04-26 16:54:00,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:00,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253352256] [2025-04-26 16:54:00,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:00,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:00,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:00,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:00,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:00,750 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:00,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:00,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:00,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:00,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:00,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:00,757 INFO L85 PathProgramCache]: Analyzing trace with hash -425663921, now seen corresponding path program 1 times [2025-04-26 16:54:00,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:00,761 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135286919] [2025-04-26 16:54:00,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:00,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:00,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:54:00,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:54:00,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:00,776 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:00,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:54:00,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:54:00,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:00,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:00,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:01,325 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:01,325 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:01,325 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:01,325 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:01,325 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:01,325 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:01,325 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:01,325 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:01,325 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-tailsum5.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:54:01,325 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:01,325 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:01,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:01,788 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:01,788 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:01,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:01,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:01,790 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:01,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:54:01,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:01,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:01,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:01,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:01,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:01,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:01,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:01,806 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:01,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 16:54:01,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:01,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:01,814 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:01,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:54:01,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:01,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:01,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:01,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:01,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:01,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:01,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:01,829 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:01,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 16:54:01,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:01,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:01,836 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:01,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:54:01,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:01,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:01,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:01,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:01,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:01,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:01,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:01,851 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:01,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:54:01,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:01,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:01,858 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:01,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:54:01,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:01,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:01,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:01,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:01,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:01,871 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:01,871 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:01,873 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:01,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 16:54:01,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:01,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:01,880 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:01,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:54:01,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:01,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:01,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:01,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:01,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:01,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:01,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:01,895 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:01,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 16:54:01,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:01,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:01,903 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:01,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:54:01,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:01,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:01,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:01,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:01,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:01,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:01,915 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:01,918 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:01,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 16:54:01,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:01,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:01,925 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:01,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:54:01,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:01,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:01,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:01,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:01,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:01,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:01,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:01,940 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:01,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 16:54:01,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:01,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:01,948 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:01,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:54:01,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:01,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:01,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:01,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:01,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:01,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:01,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:01,981 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:01,996 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:54:01,996 INFO L437 ModelExtractionUtils]: 52 out of 58 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:54:01,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:01,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:01,999 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:02,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 16:54:02,002 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:02,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:02,017 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:02,017 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:02,017 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork4_i, sumThread1of1ForFork4_hi) = -1*sumThread1of1ForFork4_i + 1*sumThread1of1ForFork4_hi Supporting invariants [] [2025-04-26 16:54:02,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:02,023 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:02,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:02,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:54:02,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:54:02,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:02,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:02,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:02,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:02,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:02,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:02,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:02,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:02,109 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:54:02,109 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7143 states and 11629 transitions. cyclomatic complexity: 5011 Second operand has 4 states, 4 states have (on average 8.25) internal successors, (in total 33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:02,224 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7143 states and 11629 transitions. cyclomatic complexity: 5011. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (in total 33), 4 states have internal predecessors, (33), 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 13755 states and 23182 transitions. Complement of second has 6 states. [2025-04-26 16:54:02,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:02,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (in total 33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:02,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2025-04-26 16:54:02,225 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 127 transitions. Stem has 29 letters. Loop has 4 letters. [2025-04-26 16:54:02,225 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:02,225 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 127 transitions. Stem has 33 letters. Loop has 4 letters. [2025-04-26 16:54:02,225 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:02,225 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 127 transitions. Stem has 29 letters. Loop has 8 letters. [2025-04-26 16:54:02,225 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:02,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13755 states and 23182 transitions. [2025-04-26 16:54:02,286 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:02,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13755 states to 0 states and 0 transitions. [2025-04-26 16:54:02,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:54:02,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:54:02,287 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:54:02,287 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:02,287 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:02,287 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:02,287 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:02,287 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:54:02,287 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:54:02,287 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:02,287 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:54:02,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:54:02,299 INFO L201 PluginConnector]: Adding new model max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:54:02 BoogieIcfgContainer [2025-04-26 16:54:02,299 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:54:02,300 INFO L158 Benchmark]: Toolchain (without parser) took 8719.28ms. Allocated memory was 159.4MB in the beginning and 369.1MB in the end (delta: 209.7MB). Free memory was 86.5MB in the beginning and 215.8MB in the end (delta: -129.3MB). Peak memory consumption was 80.5MB. Max. memory is 8.0GB. [2025-04-26 16:54:02,300 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.74ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:02,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.09ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 84.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:02,300 INFO L158 Benchmark]: Boogie Preprocessor took 27.71ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 83.5MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:54:02,300 INFO L158 Benchmark]: RCFGBuilder took 215.64ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 73.7MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:54:02,300 INFO L158 Benchmark]: BuchiAutomizer took 8435.63ms. Allocated memory was 159.4MB in the beginning and 369.1MB in the end (delta: 209.7MB). Free memory was 73.5MB in the beginning and 215.8MB in the end (delta: -142.3MB). Peak memory consumption was 67.9MB. Max. memory is 8.0GB. [2025-04-26 16:54:02,301 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.74ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.09ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 84.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.71ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 83.5MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 215.64ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 73.7MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 8435.63ms. Allocated memory was 159.4MB in the beginning and 369.1MB in the end (delta: 209.7MB). Free memory was 73.5MB in the beginning and 215.8MB in the end (delta: -142.3MB). Peak memory consumption was 67.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.2s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 4.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.5s AutomataMinimizationTime, 4 MinimizatonAttempts, 926 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.5s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 508 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 503 mSDsluCounter, 863 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 455 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 192 IncrementalHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 408 mSDtfsCounter, 192 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital137 mio100 ax100 hnf100 lsp95 ukn71 mio100 lsp63 div100 bol100 ite100 ukn100 eq168 hnf92 smp97 dnf143 smp78 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 65ms VariablesStem: 2 VariablesLoop: 6 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]: 879, Number of transitions in reduction automaton: 5118, Number of states in reduction automaton: 3344, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (0 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + hi and consists of 4 locations. One deterministic module has affine ranking function -1 * i + hi and consists of 4 locations. One deterministic module has affine ranking function -1 * i + hi and consists of 4 locations. One deterministic module has affine ranking function -1 * i + hi and consists of 4 locations. One deterministic module has affine ranking function -1 * i + hi and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:54:02,313 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...