/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-tailsum4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:53:52,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:53:52,201 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:53:52,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:53:52,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:53:52,208 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:52,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:53:52,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:53:52,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:53:52,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:53:52,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:53:52,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:53:52,231 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:53:52,232 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:53:52,232 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:53:52,232 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:53:52,232 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:53:52,232 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:53:52,233 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:53:52,233 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:53:52,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:53:52,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:53:52,233 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:53:52,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:53:52,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:53:52,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:53:52,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:53:52,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:53:52,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:53:52,233 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:53:52,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:53:52,233 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:53:52,233 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:53:52,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:53:52,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:53:52,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:52,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:53:52,234 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:53:52,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:53:52,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:53:52,234 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:53:52,234 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:53:52,234 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:53:52,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:53:52,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:53:52,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:53:52,487 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:53:52,487 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:53:52,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum4.bpl [2025-04-26 16:53:52,490 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum4.bpl' [2025-04-26 16:53:52,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:53:52,511 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:53:52,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:52,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:53:52,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:53:52,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:52" (1/1) ... [2025-04-26 16:53:52,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:52" (1/1) ... [2025-04-26 16:53:52,543 INFO L138 Inliner]: procedures = 3, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:53:52,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:52,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:53:52,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:53:52,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:53:52,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:52" (1/1) ... [2025-04-26 16:53:52,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:52" (1/1) ... [2025-04-26 16:53:52,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:52" (1/1) ... [2025-04-26 16:53:52,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:52" (1/1) ... [2025-04-26 16:53:52,555 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:52" (1/1) ... [2025-04-26 16:53:52,556 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:52" (1/1) ... [2025-04-26 16:53:52,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:52" (1/1) ... [2025-04-26 16:53:52,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:52" (1/1) ... [2025-04-26 16:53:52,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:52" (1/1) ... [2025-04-26 16:53:52,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:53:52,578 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:53:52,578 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:53:52,578 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:53:52,579 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:52" (1/1) ... [2025-04-26 16:53:52,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:52,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:52,604 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:52,606 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:52,623 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:53:52,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:53:52,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:53:52,624 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2025-04-26 16:53:52,624 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2025-04-26 16:53:52,624 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2025-04-26 16:53:52,624 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:52,663 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:53:52,665 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:53:52,749 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:53:52,749 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:53:52,760 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:53:52,761 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:53:52,761 INFO L201 PluginConnector]: Adding new model max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:52 BoogieIcfgContainer [2025-04-26 16:53:52,762 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:53:52,763 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:53:52,763 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:53:52,768 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:53:52,769 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:52,769 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:52" (1/2) ... [2025-04-26 16:53:52,771 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@676eaae3 and model type max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:53:52, skipping insertion in model container [2025-04-26 16:53:52,771 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:52,771 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:52" (2/2) ... [2025-04-26 16:53:52,772 INFO L376 chiAutomizerObserver]: Analyzing ICFG max-tailsum4.bpl [2025-04-26 16:53:52,842 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:53:52,876 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:53:52,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:53:52,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:52,879 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:52,880 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:52,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 56 transitions, 140 flow [2025-04-26 16:53:52,958 INFO L116 PetriNetUnfolderBase]: 4/48 cut-off events. [2025-04-26 16:53:52,960 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:53:52,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 48 events. 4/48 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-04-26 16:53:52,966 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 56 transitions, 140 flow [2025-04-26 16:53:52,969 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 48 transitions, 120 flow [2025-04-26 16:53:52,970 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 57 places, 48 transitions, 120 flow [2025-04-26 16:53:52,975 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:53:53,284 WARN L140 AmpleReduction]: Number of pruned transitions: 1563 [2025-04-26 16:53:53,284 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:53:53,284 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 111 [2025-04-26 16:53:53,284 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:32 [2025-04-26 16:53:53,284 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:727 [2025-04-26 16:53:53,284 WARN L145 AmpleReduction]: Times succ was already a loop node:52 [2025-04-26 16:53:53,284 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:196 [2025-04-26 16:53:53,284 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:53:53,289 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 871 states, 869 states have (on average 1.478711162255466) internal successors, (in total 1285), 870 states have internal predecessors, (1285), 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:53,296 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:53:53,297 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:53:53,297 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:53:53,297 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:53:53,297 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:53:53,297 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:53:53,297 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:53:53,297 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:53:53,299 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 871 states, 869 states have (on average 1.478711162255466) internal successors, (in total 1285), 870 states have internal predecessors, (1285), 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:53,331 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 699 [2025-04-26 16:53:53,331 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:53,332 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:53,337 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:53:53,338 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:53:53,338 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:53:53,340 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 871 states, 869 states have (on average 1.478711162255466) internal successors, (in total 1285), 870 states have internal predecessors, (1285), 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:53,351 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 699 [2025-04-26 16:53:53,351 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:53,351 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:53,352 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:53:53,352 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:53:53,358 INFO L752 eck$LassoCheckResult]: Stem: "[43] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_N_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_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} 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} AuxVars[] AssignedVars[]" "[84] 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]" "[46] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork0_x_1 0) InVars {} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_x]" "[47] L28-->L30: Formula: (= v_sumThread1of1ForFork0_z_1 0) InVars {} OutVars{sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_z]" "[48] 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:53,359 INFO L754 eck$LassoCheckResult]: Loop: "[50] 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[]" "[52] 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]" "[53] 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]" "[54] 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:53,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:53,364 INFO L85 PathProgramCache]: Analyzing trace with hash 70888709, now seen corresponding path program 1 times [2025-04-26 16:53:53,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:53,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357354305] [2025-04-26 16:53:53,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:53,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:53,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:53:53,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:53:53,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:53,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:53,417 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:53,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:53:53,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:53:53,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:53,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:53,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:53,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:53,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2464740, now seen corresponding path program 1 times [2025-04-26 16:53:53,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:53,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701601451] [2025-04-26 16:53:53,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:53,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:53,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:53,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:53,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:53,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:53,458 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:53,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:53,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:53,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:53,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:53,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:53,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:53,500 INFO L85 PathProgramCache]: Analyzing trace with hash -973527320, now seen corresponding path program 1 times [2025-04-26 16:53:53,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:53,500 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104285873] [2025-04-26 16:53:53,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:53,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:53,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:53,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:53,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:53,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:53,523 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:53,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:53,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:53,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:53,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:53,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:53,755 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:53,756 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:53,756 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:53,756 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:53,756 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:53,756 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:53,756 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:53,756 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:53,757 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-tailsum4.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:53:53,757 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:53,757 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:53,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:53,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:53,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:53,993 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:53,995 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:53,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:53,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:54,000 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:54,002 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:54,004 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:54,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:54,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:54,016 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:53:54,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:54,034 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:53:54,034 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:53:54,048 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:54,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:54,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:54,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:54,059 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:54,061 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:54,063 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:54,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:54,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:54,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:54,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:54,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:54,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:54,086 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:54,114 INFO L436 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-04-26 16:53:54,114 INFO L437 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-04-26 16:53:54,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:54,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:54,119 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:54,121 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:54,122 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:54,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:53:54,139 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:54,139 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:54,140 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:54,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:54,149 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:54,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:54,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:53:54,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:53:54,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:54,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:54,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:54,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:54,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:54,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:54,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:54,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:54,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:54,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:54,281 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:54,298 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:54,301 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 871 states, 869 states have (on average 1.478711162255466) internal successors, (in total 1285), 870 states have internal predecessors, (1285), 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:54,416 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 871 states, 869 states have (on average 1.478711162255466) internal successors, (in total 1285), 870 states have internal predecessors, (1285), 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 1837 states and 2775 transitions. Complement of second has 6 states. [2025-04-26 16:53:54,418 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:54,420 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:54,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-04-26 16:53:54,426 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 89 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:53:54,427 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:54,427 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 89 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:53:54,427 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:54,427 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 89 transitions. Stem has 5 letters. Loop has 8 letters. [2025-04-26 16:53:54,427 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:54,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1837 states and 2775 transitions. [2025-04-26 16:53:54,440 INFO L131 ngComponentsAnalysis]: Automaton has 92 accepting balls. 501 [2025-04-26 16:53:54,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1837 states to 1077 states and 1548 transitions. [2025-04-26 16:53:54,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 662 [2025-04-26 16:53:54,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 726 [2025-04-26 16:53:54,455 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1077 states and 1548 transitions. [2025-04-26 16:53:54,456 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:54,456 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1077 states and 1548 transitions. [2025-04-26 16:53:54,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states and 1548 transitions. [2025-04-26 16:53:54,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1021. [2025-04-26 16:53:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1021 states have (on average 1.4427032321253672) internal successors, (in total 1473), 1020 states have internal predecessors, (1473), 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,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1473 transitions. [2025-04-26 16:53:54,511 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1021 states and 1473 transitions. [2025-04-26 16:53:54,511 INFO L438 stractBuchiCegarLoop]: Abstraction has 1021 states and 1473 transitions. [2025-04-26 16:53:54,511 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:53:54,511 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1021 states and 1473 transitions. [2025-04-26 16:53:54,515 INFO L131 ngComponentsAnalysis]: Automaton has 92 accepting balls. 501 [2025-04-26 16:53:54,515 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:54,515 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:54,516 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:54,516 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:53:54,516 INFO L752 eck$LassoCheckResult]: Stem: "[43] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_N_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_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} 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} AuxVars[] AssignedVars[]" "[84] 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]" "[46] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork0_x_1 0) InVars {} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_x]" "[47] L28-->L30: Formula: (= v_sumThread1of1ForFork0_z_1 0) InVars {} OutVars{sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_z]" "[48] 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]" "[49] 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[]" "[51] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[87] 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]" "[64] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork1_x_1 0) InVars {} OutVars{sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_x]" "[65] L28-->L30: Formula: (= v_sumThread1of1ForFork1_z_1 0) InVars {} OutVars{sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_z]" "[66] 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:54,517 INFO L754 eck$LassoCheckResult]: Loop: "[68] 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[]" "[70] 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]" "[71] 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]" "[72] 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:54,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:54,517 INFO L85 PathProgramCache]: Analyzing trace with hash 714587921, now seen corresponding path program 1 times [2025-04-26 16:53:54,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:54,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017719816] [2025-04-26 16:53:54,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:54,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:54,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:53:54,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:53:54,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:54,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:54,524 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:54,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:53:54,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:53:54,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:54,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:54,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:54,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:54,540 INFO L85 PathProgramCache]: Analyzing trace with hash 3018852, now seen corresponding path program 1 times [2025-04-26 16:53:54,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:54,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084610491] [2025-04-26 16:53:54,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:54,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:54,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:54,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:54,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:54,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:54,547 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:54,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:54,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:54,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:54,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:54,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:54,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:54,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1951414412, now seen corresponding path program 1 times [2025-04-26 16:53:54,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:54,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339857891] [2025-04-26 16:53:54,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:54,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:54,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:54,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:54,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:54,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:54,567 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:54,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:54,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:54,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:54,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:54,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:54,798 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:54,798 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:54,798 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:54,798 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:54,798 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:54,799 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:54,799 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:54,799 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:54,799 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-tailsum4.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:53:54,799 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:54,799 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:54,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:54,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,054 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:55,054 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:55,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:55,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:55,057 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:55,060 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:55,061 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,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:55,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:55,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:55,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:55,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:55,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:55,075 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:55,081 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:55,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:55,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:55,085 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:55,086 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:55,088 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,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:55,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:55,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:55,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:55,100 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:55,100 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:55,102 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:55,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:55,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:55,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:55,111 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:55,112 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:55,113 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,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:55,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:55,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:55,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:55,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:55,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:55,128 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:55,133 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:55,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:55,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:55,136 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:55,137 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:55,138 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,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:55,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:55,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:55,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:55,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:55,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:55,153 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:55,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:55,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:55,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:55,161 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:55,162 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:55,164 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,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:55,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:55,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:55,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:55,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:55,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:55,185 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:55,194 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:53:55,194 INFO L437 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:53:55,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:55,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:55,197 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:55,198 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:55,199 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:55,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:53:55,217 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:55,217 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:55,218 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:55,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:55,224 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:55,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:55,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:53:55,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:53:55,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:55,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:55,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:55,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:55,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:55,267 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,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:55,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:55,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:55,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:55,301 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:55,302 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:55,302 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1021 states and 1473 transitions. cyclomatic complexity: 576 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:55,368 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1021 states and 1473 transitions. cyclomatic complexity: 576. 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 2197 states and 3233 transitions. Complement of second has 6 states. [2025-04-26 16:53:55,370 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:55,370 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:55,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-04-26 16:53:55,371 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:53:55,371 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:55,371 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 16:53:55,371 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:55,371 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 92 transitions. Stem has 11 letters. Loop has 8 letters. [2025-04-26 16:53:55,371 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:55,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2197 states and 3233 transitions. [2025-04-26 16:53:55,385 INFO L131 ngComponentsAnalysis]: Automaton has 67 accepting balls. 307 [2025-04-26 16:53:55,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2197 states to 1296 states and 1871 transitions. [2025-04-26 16:53:55,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 523 [2025-04-26 16:53:55,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 577 [2025-04-26 16:53:55,393 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1296 states and 1871 transitions. [2025-04-26 16:53:55,393 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:55,393 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1296 states and 1871 transitions. [2025-04-26 16:53:55,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states and 1871 transitions. [2025-04-26 16:53:55,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1244. [2025-04-26 16:53:55,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 1244 states have (on average 1.4485530546623795) internal successors, (in total 1802), 1243 states have internal predecessors, (1802), 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,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1802 transitions. [2025-04-26 16:53:55,425 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1244 states and 1802 transitions. [2025-04-26 16:53:55,425 INFO L438 stractBuchiCegarLoop]: Abstraction has 1244 states and 1802 transitions. [2025-04-26 16:53:55,425 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:53:55,425 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1244 states and 1802 transitions. [2025-04-26 16:53:55,430 INFO L131 ngComponentsAnalysis]: Automaton has 67 accepting balls. 307 [2025-04-26 16:53:55,430 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:55,430 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:55,431 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:55,431 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:53:55,432 INFO L752 eck$LassoCheckResult]: Stem: "[43] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_N_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_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} 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} AuxVars[] AssignedVars[]" "[84] 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]" "[46] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork0_x_1 0) InVars {} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_x]" "[47] L28-->L30: Formula: (= v_sumThread1of1ForFork0_z_1 0) InVars {} OutVars{sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_z]" "[48] 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]" "[49] 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[]" "[51] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[87] 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]" "[64] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork1_x_1 0) InVars {} OutVars{sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_x]" "[65] L28-->L30: Formula: (= v_sumThread1of1ForFork1_z_1 0) InVars {} OutVars{sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_z]" "[66] 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]" "[67] 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[]" "[69] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[90] 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]" "[73] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork2_x_1 0) InVars {} OutVars{sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork2_x]" "[74] L28-->L30: Formula: (= v_sumThread1of1ForFork2_z_1 0) InVars {} OutVars{sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork2_z]" "[75] 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:55,444 INFO L754 eck$LassoCheckResult]: Loop: "[77] 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[]" "[79] 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]" "[80] 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]" "[81] 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:55,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:55,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1562475107, now seen corresponding path program 1 times [2025-04-26 16:53:55,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:55,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626750313] [2025-04-26 16:53:55,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:55,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:55,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:53:55,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:53:55,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:55,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:55,458 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:55,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:53:55,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:53:55,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:55,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:55,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:55,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:55,465 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 1 times [2025-04-26 16:53:55,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:55,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742472346] [2025-04-26 16:53:55,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:55,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:55,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:55,469 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,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:55,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:55,470 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:55,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:55,472 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,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:55,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:55,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:55,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:55,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1586772986, now seen corresponding path program 1 times [2025-04-26 16:53:55,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:55,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957886527] [2025-04-26 16:53:55,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:55,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:55,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:53:55,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:53:55,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:55,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:55,484 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:55,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:53:55,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:53:55,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:55,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:55,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:55,751 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:55,751 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:55,751 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:55,752 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:55,752 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:55,752 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:55,752 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:55,752 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:55,752 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-tailsum4.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:53:55,752 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:55,752 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:55,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:55,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:56,139 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:56,139 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:56,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,142 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:56,142 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:56,146 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:56,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:56,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:56,160 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:56,165 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:56,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,167 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:56,169 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:56,170 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:56,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:56,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:56,184 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:56,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:56,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,193 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:56,194 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:56,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:56,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,206 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:53:56,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,214 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:53:56,214 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:53:56,238 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:56,244 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:56,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,246 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:56,248 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:56,249 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:56,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:56,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:56,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:56,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:56,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:56,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:56,272 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:56,285 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:53:56,285 INFO L437 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:53:56,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:56,287 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:56,288 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:56,289 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:56,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:53:56,305 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:56,305 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:56,305 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:56,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:53:56,312 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:56,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:56,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:53:56,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:53:56,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:56,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:56,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:56,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:56,375 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,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:56,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:56,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:56,410 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,410 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,411 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1244 states and 1802 transitions. cyclomatic complexity: 692 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:56,473 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1244 states and 1802 transitions. cyclomatic complexity: 692. 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 2862 states and 4288 transitions. Complement of second has 6 states. [2025-04-26 16:53:56,473 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:56,474 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:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2025-04-26 16:53:56,474 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 17 letters. Loop has 4 letters. [2025-04-26 16:53:56,474 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:56,474 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 21 letters. Loop has 4 letters. [2025-04-26 16:53:56,474 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:56,475 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 94 transitions. Stem has 17 letters. Loop has 8 letters. [2025-04-26 16:53:56,475 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:56,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2862 states and 4288 transitions. [2025-04-26 16:53:56,493 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 128 [2025-04-26 16:53:56,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2862 states to 1406 states and 2138 transitions. [2025-04-26 16:53:56,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 358 [2025-04-26 16:53:56,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 403 [2025-04-26 16:53:56,503 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1406 states and 2138 transitions. [2025-04-26 16:53:56,503 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:56,503 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1406 states and 2138 transitions. [2025-04-26 16:53:56,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states and 2138 transitions. [2025-04-26 16:53:56,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1337. [2025-04-26 16:53:56,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 1337 states have (on average 1.5362752430815259) internal successors, (in total 2054), 1336 states have internal predecessors, (2054), 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,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2054 transitions. [2025-04-26 16:53:56,526 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1337 states and 2054 transitions. [2025-04-26 16:53:56,526 INFO L438 stractBuchiCegarLoop]: Abstraction has 1337 states and 2054 transitions. [2025-04-26 16:53:56,527 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:53:56,527 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1337 states and 2054 transitions. [2025-04-26 16:53:56,532 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 128 [2025-04-26 16:53:56,533 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:56,533 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:56,533 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:56,533 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:53:56,534 INFO L752 eck$LassoCheckResult]: Stem: "[43] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_N_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_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} 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} AuxVars[] AssignedVars[]" "[84] 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]" "[46] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork0_x_1 0) InVars {} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_x]" "[47] L28-->L30: Formula: (= v_sumThread1of1ForFork0_z_1 0) InVars {} OutVars{sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_z]" "[48] 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]" "[49] 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[]" "[51] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[87] 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]" "[64] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork1_x_1 0) InVars {} OutVars{sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_x]" "[65] L28-->L30: Formula: (= v_sumThread1of1ForFork1_z_1 0) InVars {} OutVars{sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_z]" "[66] 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]" "[67] 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[]" "[69] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[90] 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]" "[73] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork2_x_1 0) InVars {} OutVars{sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork2_x]" "[74] L28-->L30: Formula: (= v_sumThread1of1ForFork2_z_1 0) InVars {} OutVars{sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork2_z]" "[75] 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]" "[76] 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[]" "[78] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[93] L56-->$Ultimate##0: Formula: (and (= v_N_3 v_sumThread1of1ForFork3_hi_6) (= (+ v_ULTIMATE.start_k3_5 1) v_sumThread1of1ForFork3_lo_4) (= v_sumThread1of1ForFork3_thidvar1_2 4) (= v_sumThread1of1ForFork3_thidvar2_2 4) (= v_sumThread1of1ForFork3_thidvar0_2 4) (= v_sumThread1of1ForFork3_thidvar3_2 4)) InVars {N=v_N_3, ULTIMATE.start_k3=v_ULTIMATE.start_k3_5} OutVars{N=v_N_3, 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_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]" "[55] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork3_x_1 0) InVars {} OutVars{sumThread1of1ForFork3_x=v_sumThread1of1ForFork3_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork3_x]" "[56] L28-->L30: Formula: (= v_sumThread1of1ForFork3_z_1 0) InVars {} OutVars{sumThread1of1ForFork3_z=v_sumThread1of1ForFork3_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork3_z]" "[57] 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:56,534 INFO L754 eck$LassoCheckResult]: Loop: "[59] 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[]" "[61] 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]" "[62] 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]" "[63] 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:56,534 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:56,535 INFO L85 PathProgramCache]: Analyzing trace with hash -204638048, now seen corresponding path program 1 times [2025-04-26 16:53:56,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:56,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420628169] [2025-04-26 16:53:56,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:56,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:56,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:53:56,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:53:56,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:56,544 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:56,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:53:56,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:53:56,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:56,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:56,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:56,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2741796, now seen corresponding path program 1 times [2025-04-26 16:53:56,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:56,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857965553] [2025-04-26 16:53:56,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:56,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:56,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:56,563 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,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:56,563 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:56,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:56,566 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,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:56,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:56,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:56,568 INFO L85 PathProgramCache]: Analyzing trace with hash -381950141, now seen corresponding path program 1 times [2025-04-26 16:53:56,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:56,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572680784] [2025-04-26 16:53:56,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:56,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:56,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:53:56,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:53:56,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:56,577 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:56,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:53:56,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:53:56,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:56,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:56,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:56,994 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:56,994 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:56,994 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:56,994 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:56,994 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:56,994 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:56,994 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:56,994 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:56,994 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-tailsum4.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:53:56,994 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:56,994 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:56,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:56,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:57,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:57,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:57,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:57,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:57,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:57,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:57,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:57,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:57,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:57,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:57,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:57,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:57,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:57,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:57,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:57,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:57,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:57,390 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:57,391 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:57,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:57,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:57,398 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:57,400 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:57,400 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,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:57,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:57,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:57,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:57,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:57,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:57,416 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:57,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:53:57,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:57,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:57,424 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:57,425 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:57,426 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,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:57,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:57,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:57,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:57,438 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:57,438 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:57,444 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:57,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:53:57,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:57,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:57,455 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:57,458 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:57,461 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,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:57,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:57,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:57,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:57,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:57,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:57,494 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:57,516 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:53:57,516 INFO L437 ModelExtractionUtils]: 39 out of 46 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:53:57,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:57,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:57,518 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:57,520 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:57,521 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:57,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:57,537 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:57,537 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:57,537 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:53:57,543 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:57,545 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:57,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:57,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:53:57,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:53:57,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:57,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:57,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:57,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:57,597 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,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:57,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:57,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:57,620 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,621 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,621 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1337 states and 2054 transitions. cyclomatic complexity: 839 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:53:57,668 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1337 states and 2054 transitions. cyclomatic complexity: 839. 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 2561 states and 4054 transitions. Complement of second has 6 states. [2025-04-26 16:53:57,669 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,669 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:53:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-04-26 16:53:57,670 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 23 letters. Loop has 4 letters. [2025-04-26 16:53:57,670 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:57,670 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 27 letters. Loop has 4 letters. [2025-04-26 16:53:57,670 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:57,670 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 23 letters. Loop has 8 letters. [2025-04-26 16:53:57,670 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:57,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2561 states and 4054 transitions. [2025-04-26 16:53:57,685 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:53:57,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2561 states to 0 states and 0 transitions. [2025-04-26 16:53:57,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:53:57,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:53:57,686 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:53:57,686 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:53:57,686 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:53:57,686 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:53:57,686 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:53:57,686 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:53:57,686 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:53:57,686 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:53:57,686 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:53:57,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:57,700 INFO L201 PluginConnector]: Adding new model max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:53:57 BoogieIcfgContainer [2025-04-26 16:53:57,700 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:53:57,701 INFO L158 Benchmark]: Toolchain (without parser) took 5190.05ms. Allocated memory was 155.2MB in the beginning and 180.4MB in the end (delta: 25.2MB). Free memory was 82.9MB in the beginning and 120.8MB in the end (delta: -37.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:57,701 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.80ms. Allocated memory is still 155.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:57,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.44ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 80.5MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:53:57,702 INFO L158 Benchmark]: Boogie Preprocessor took 32.65ms. Allocated memory is still 155.2MB. Free memory was 80.5MB in the beginning and 79.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:57,702 INFO L158 Benchmark]: RCFGBuilder took 183.75ms. Allocated memory is still 155.2MB. Free memory was 79.5MB in the beginning and 70.2MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:53:57,702 INFO L158 Benchmark]: BuchiAutomizer took 4937.47ms. Allocated memory was 155.2MB in the beginning and 180.4MB in the end (delta: 25.2MB). Free memory was 70.0MB in the beginning and 120.8MB in the end (delta: -50.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:57,704 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.80ms. Allocated memory is still 155.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.44ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 80.5MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.65ms. Allocated memory is still 155.2MB. Free memory was 80.5MB in the beginning and 79.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 183.75ms. Allocated memory is still 155.2MB. Free memory was 79.5MB in the beginning and 70.2MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 4937.47ms. Allocated memory was 155.2MB in the beginning and 180.4MB in the end (delta: 25.2MB). Free memory was 70.0MB in the beginning and 120.8MB in the end (delta: -50.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 177 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 309 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 305 mSDsluCounter, 526 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 276 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 250 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital118 mio100 ax100 hnf100 lsp100 ukn69 mio100 lsp60 div100 bol100 ite100 ukn100 eq168 hnf92 smp97 dnf158 smp71 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 52ms 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.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 411, Number of transitions in reduction automaton: 1285, Number of states in reduction automaton: 871, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 4 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. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:53:57,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...