/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/buchiAutomizer/concurrent-automaton-noLbe.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:21:22,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:21:22,719 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:21:22,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:21:22,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:21:22,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:21:22,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:21:22,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:21:22,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:21:22,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:21:22,749 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:21:22,750 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:21:22,750 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:21:22,750 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:21:22,750 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:21:22,750 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:21:22,750 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:21:22,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:21:22,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:21:22,751 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:21:22,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:21:22,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:21:22,751 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:21:22,751 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:21:22,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:21:22,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:21:22,751 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:21:22,751 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:21:22,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:21:22,751 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:21:22,751 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:21:22,751 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:21:22,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:21:22,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:21:22,751 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:21:22,752 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:21:22,752 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:21:22,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:21:22,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:21:22,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:21:22,991 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:21:22,991 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:21:22,992 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:21:22,992 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum4.bpl' [2025-04-26 16:21:23,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:21:23,013 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:21:23,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:23,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:21:23,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:21:23,020 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:21:23" (1/1) ... [2025-04-26 16:21:23,044 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:21:23" (1/1) ... [2025-04-26 16:21:23,049 INFO L138 Inliner]: procedures = 3, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:21:23,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:23,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:21:23,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:21:23,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:21:23,057 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:21:23" (1/1) ... [2025-04-26 16:21:23,057 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:21:23" (1/1) ... [2025-04-26 16:21:23,060 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:21:23" (1/1) ... [2025-04-26 16:21:23,060 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:21:23" (1/1) ... [2025-04-26 16:21:23,064 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:21:23" (1/1) ... [2025-04-26 16:21:23,064 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:21:23" (1/1) ... [2025-04-26 16:21:23,067 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:21:23" (1/1) ... [2025-04-26 16:21:23,069 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:21:23" (1/1) ... [2025-04-26 16:21:23,070 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:21:23" (1/1) ... [2025-04-26 16:21:23,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:21:23,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:21:23,081 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:21:23,081 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:21:23,082 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:21:23" (1/1) ... [2025-04-26 16:21:23,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:23,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:23,104 INFO L229 MonitoredProcess]: Starting monitored process 1 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:21:23,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:21:23,124 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:21:23,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:21:23,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:21:23,124 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2025-04-26 16:21:23,124 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2025-04-26 16:21:23,124 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2025-04-26 16:21:23,125 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:21:23,159 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:21:23,161 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:21:23,234 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:21:23,234 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:21:23,243 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:21:23,243 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:21:23,243 INFO L201 PluginConnector]: Adding new model max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:23 BoogieIcfgContainer [2025-04-26 16:21:23,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:21:23,244 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:21:23,244 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:21:23,249 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:21:23,250 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:23,250 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:21:23" (1/2) ... [2025-04-26 16:21:23,251 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51d0d856 and model type max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:21:23, skipping insertion in model container [2025-04-26 16:21:23,252 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:23,252 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:21:23" (2/2) ... [2025-04-26 16:21:23,253 INFO L376 chiAutomizerObserver]: Analyzing ICFG max-tailsum4.bpl [2025-04-26 16:21:23,321 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:21:23,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 56 transitions, 140 flow [2025-04-26 16:21:23,377 INFO L116 PetriNetUnfolderBase]: 4/48 cut-off events. [2025-04-26 16:21:23,380 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:21:23,384 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:21:23,384 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 56 transitions, 140 flow [2025-04-26 16:21:23,387 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 48 transitions, 120 flow [2025-04-26 16:21:23,387 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 57 places, 48 transitions, 120 flow [2025-04-26 16:21:23,395 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:21:23,395 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:21:23,395 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:21:23,395 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:21:23,395 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:21:23,396 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:21:23,396 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:21:23,396 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:21:23,397 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:21:24,100 INFO L131 ngComponentsAnalysis]: Automaton has 877 accepting balls. 7264 [2025-04-26 16:21:24,100 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:24,100 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:24,104 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:24,104 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:21:24,104 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:21:24,104 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 8204 states, but on-demand construction may add more states [2025-04-26 16:21:24,227 INFO L131 ngComponentsAnalysis]: Automaton has 877 accepting balls. 7264 [2025-04-26 16:21:24,228 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:24,228 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:24,228 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:24,228 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:21:24,232 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:21:24,233 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:21:24,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:24,241 INFO L85 PathProgramCache]: Analyzing trace with hash 70888709, now seen corresponding path program 1 times [2025-04-26 16:21:24,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:24,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411195432] [2025-04-26 16:21:24,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:24,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:24,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:24,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:24,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:24,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:24,307 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:24,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:24,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:24,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:24,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:24,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:24,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:24,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2464740, now seen corresponding path program 1 times [2025-04-26 16:21:24,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:24,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553734507] [2025-04-26 16:21:24,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:24,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:24,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:24,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:24,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:24,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:24,343 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:24,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:24,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:24,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:24,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:24,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:24,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:24,353 INFO L85 PathProgramCache]: Analyzing trace with hash -973527320, now seen corresponding path program 1 times [2025-04-26 16:21:24,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:24,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292586757] [2025-04-26 16:21:24,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:24,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:24,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:21:24,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:21:24,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:24,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:24,368 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:24,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:21:24,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:21:24,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:24,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:24,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:24,568 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:24,569 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:24,569 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:24,569 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:24,569 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:24,569 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:24,569 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:24,569 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:24,570 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-tailsum4.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:21:24,570 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:24,570 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:24,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:24,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:24,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:24,802 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:24,806 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:24,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:24,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:24,811 INFO L229 MonitoredProcess]: Starting monitored process 2 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:21:24,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:21:24,815 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:21:24,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:24,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:24,828 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:24,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:24,852 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:21:24,852 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:24,877 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:24,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:24,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:24,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:24,904 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:21:24,909 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:21:24,909 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:21:24,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:24,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:24,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:24,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:24,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:24,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:24,937 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:24,956 INFO L436 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-04-26 16:21:24,956 INFO L437 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-04-26 16:21:24,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:24,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:24,959 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:21:24,961 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:21:24,962 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:24,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:21:24,981 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:24,981 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:24,982 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:21:24,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:21:24,990 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:25,014 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:25,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:25,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:25,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:25,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:25,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:25,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:25,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:25,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:25,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:25,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:25,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:25,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:25,086 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:21:25,110 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:21:25,112 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 8204 states, but on-demand construction may add more states 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:21:25,544 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 8204 states, but on-demand construction may add more states. 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 18863 states and 83179 transitions. Complement of second has 6 states. [2025-04-26 16:21:25,547 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:21:25,552 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:21:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-04-26 16:21:25,560 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 141 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:21:25,561 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:25,561 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 141 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:21:25,561 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:25,561 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 141 transitions. Stem has 5 letters. Loop has 8 letters. [2025-04-26 16:21:25,561 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:25,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18863 states and 83179 transitions. [2025-04-26 16:21:25,952 INFO L131 ngComponentsAnalysis]: Automaton has 1030 accepting balls. 6640 [2025-04-26 16:21:26,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18863 states to 16230 states and 71908 transitions. [2025-04-26 16:21:26,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8924 [2025-04-26 16:21:26,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12171 [2025-04-26 16:21:26,292 INFO L74 IsDeterministic]: Start isDeterministic. Operand 16230 states and 71908 transitions. [2025-04-26 16:21:26,292 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:26,293 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16230 states and 71908 transitions. [2025-04-26 16:21:26,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16230 states and 71908 transitions. [2025-04-26 16:21:26,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16230 to 12985. [2025-04-26 16:21:26,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12985 states, 12985 states have (on average 4.478706199460916) internal successors, (in total 58156), 12984 states have internal predecessors, (58156), 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:21:26,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12985 states to 12985 states and 58156 transitions. [2025-04-26 16:21:26,954 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12985 states and 58156 transitions. [2025-04-26 16:21:26,954 INFO L438 stractBuchiCegarLoop]: Abstraction has 12985 states and 58156 transitions. [2025-04-26 16:21:26,954 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:21:26,954 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12985 states and 58156 transitions. [2025-04-26 16:21:27,071 INFO L131 ngComponentsAnalysis]: Automaton has 1030 accepting balls. 6640 [2025-04-26 16:21:27,072 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:27,072 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:27,072 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:21:27,072 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:21:27,073 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]" "[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:21:27,073 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:21:27,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:27,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2096178956, now seen corresponding path program 1 times [2025-04-26 16:21:27,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:27,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537168363] [2025-04-26 16:21:27,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:27,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:27,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:27,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:27,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:27,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:27,079 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:27,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:27,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:27,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:27,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:27,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:27,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:27,091 INFO L85 PathProgramCache]: Analyzing trace with hash 3018852, now seen corresponding path program 1 times [2025-04-26 16:21:27,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:27,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097850776] [2025-04-26 16:21:27,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:27,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:27,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:27,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:27,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:27,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:27,097 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:27,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:27,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:27,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:27,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:27,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:27,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:27,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1030830039, now seen corresponding path program 1 times [2025-04-26 16:21:27,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:27,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431224923] [2025-04-26 16:21:27,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:27,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:27,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:27,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:27,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:27,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:27,122 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:27,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:27,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:27,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:27,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:27,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:27,285 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:27,285 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:27,285 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:27,285 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:27,285 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:27,285 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:27,285 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:27,285 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:27,285 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-tailsum4.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:21:27,285 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:27,285 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:27,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:27,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:27,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:27,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:27,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:27,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:27,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:27,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:27,514 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:27,514 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:27,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:27,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:27,516 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:21:27,518 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:21:27,519 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:21:27,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:27,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:27,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:27,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:27,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:27,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:27,535 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:27,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:27,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:27,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:27,543 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:21:27,545 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:21:27,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:27,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:27,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:27,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:27,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:27,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:27,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:27,561 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:27,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:27,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:27,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:27,569 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:21:27,570 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:21:27,572 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:21:27,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:27,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:27,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:27,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:27,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:27,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:27,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:27,584 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:27,590 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:21:27,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:27,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:27,592 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:21:27,593 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:21:27,595 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:21:27,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:27,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:27,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:27,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:27,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:27,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:27,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:27,607 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:27,613 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:21:27,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:27,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:27,615 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:21:27,616 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:21:27,617 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:21:27,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:27,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:27,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:27,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:27,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:27,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:27,640 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:27,651 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:21:27,651 INFO L437 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:27,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:27,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:27,653 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:21:27,655 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:21:27,656 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:27,673 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:21:27,673 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:27,673 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:27,673 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:21:27,679 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:21:27,680 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:27,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:27,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:27,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:27,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:27,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:27,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:27,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:27,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:27,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:27,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:27,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:27,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:27,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:27,736 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:21:27,737 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:21:27,737 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12985 states and 58156 transitions. cyclomatic complexity: 46452 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:28,290 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12985 states and 58156 transitions. cyclomatic complexity: 46452. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 32913 states and 159173 transitions. Complement of second has 6 states. [2025-04-26 16:21:28,291 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:21:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2025-04-26 16:21:28,292 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 137 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:21:28,292 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:28,292 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 137 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:21:28,292 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:28,292 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 137 transitions. Stem has 6 letters. Loop has 8 letters. [2025-04-26 16:21:28,293 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:28,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32913 states and 159173 transitions. [2025-04-26 16:21:28,766 INFO L131 ngComponentsAnalysis]: Automaton has 1083 accepting balls. 5424 [2025-04-26 16:21:29,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32913 states to 27735 states and 134216 transitions. [2025-04-26 16:21:29,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10255 [2025-04-26 16:21:29,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13693 [2025-04-26 16:21:29,220 INFO L74 IsDeterministic]: Start isDeterministic. Operand 27735 states and 134216 transitions. [2025-04-26 16:21:29,220 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:29,220 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27735 states and 134216 transitions. [2025-04-26 16:21:29,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27735 states and 134216 transitions. [2025-04-26 16:21:29,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27735 to 23518. [2025-04-26 16:21:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23518 states, 23518 states have (on average 4.940130963517306) internal successors, (in total 116182), 23517 states have internal predecessors, (116182), 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:21:30,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23518 states to 23518 states and 116182 transitions. [2025-04-26 16:21:30,133 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23518 states and 116182 transitions. [2025-04-26 16:21:30,133 INFO L438 stractBuchiCegarLoop]: Abstraction has 23518 states and 116182 transitions. [2025-04-26 16:21:30,133 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:21:30,133 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23518 states and 116182 transitions. [2025-04-26 16:21:30,493 INFO L131 ngComponentsAnalysis]: Automaton has 1083 accepting balls. 5424 [2025-04-26 16:21:30,493 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:30,494 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:30,494 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:30,494 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:21:30,495 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]" "[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]" "[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:21:30,495 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:21:30,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:30,496 INFO L85 PathProgramCache]: Analyzing trace with hash -556255619, now seen corresponding path program 1 times [2025-04-26 16:21:30,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:30,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515966479] [2025-04-26 16:21:30,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:30,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:30,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:30,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:30,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:30,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:30,502 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:30,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:30,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:30,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:30,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:30,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:30,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:30,515 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 1 times [2025-04-26 16:21:30,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:30,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341846173] [2025-04-26 16:21:30,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:30,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:30,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:30,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:30,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:30,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:30,522 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:30,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:30,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:30,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:30,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:30,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:30,532 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:30,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1294802144, now seen corresponding path program 1 times [2025-04-26 16:21:30,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:30,532 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789824932] [2025-04-26 16:21:30,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:30,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:30,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:21:30,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:21:30,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:30,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:30,545 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:30,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:21:30,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:21:30,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:30,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:30,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:30,968 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:30,968 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:30,968 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:30,968 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:30,968 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:30,968 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:30,968 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:30,968 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:30,969 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-tailsum4.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:21:30,969 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:30,969 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:30,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:30,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:30,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:30,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:30,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:30,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:30,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:30,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:30,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:30,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:31,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:31,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:31,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:31,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:31,226 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:31,226 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:31,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:31,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:31,228 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:21:31,230 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:21:31,231 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:21:31,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:31,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:31,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:31,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:31,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:31,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:31,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:31,242 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:31,247 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:21:31,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:31,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:31,249 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:21:31,250 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:21:31,251 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:21:31,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:31,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:31,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:31,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:31,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:31,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:31,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:31,262 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:31,267 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:21:31,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:31,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:31,269 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:21:31,270 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:21:31,271 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:21:31,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:31,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:31,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:31,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:31,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:31,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:31,285 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:31,291 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:21:31,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:31,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:31,293 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:21:31,293 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:21:31,296 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:21:31,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:31,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:31,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:31,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:31,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:31,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:31,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:31,307 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:31,312 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:21:31,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:31,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:31,315 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:21:31,316 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:21:31,317 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:21:31,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:31,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:31,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:31,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:31,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:31,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:31,330 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:31,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:31,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:31,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:31,339 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:21:31,340 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:21:31,341 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:21:31,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:31,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:31,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:31,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:31,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:31,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:31,354 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:31,360 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:21:31,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:31,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:31,362 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:21:31,362 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:21:31,364 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:21:31,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:31,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:31,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:31,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:31,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:31,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:31,378 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:31,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:31,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:31,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:31,388 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:21:31,389 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:21:31,390 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:21:31,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:31,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:31,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:31,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:31,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:31,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:31,404 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:31,409 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:21:31,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:31,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:31,411 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:21:31,412 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:21:31,413 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:21:31,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:31,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:31,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:31,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:31,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:31,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:31,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:31,425 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:31,430 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:21:31,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:31,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:31,432 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:21:31,433 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:21:31,434 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:21:31,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:31,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:31,444 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:31,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:31,453 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:21:31,453 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:31,465 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:31,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:21:31,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:31,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:31,473 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:31,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:21:31,476 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:21:31,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:31,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:31,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:31,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:31,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:31,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:31,500 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:31,523 INFO L436 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-04-26 16:21:31,524 INFO L437 ModelExtractionUtils]: 10 out of 34 variables were initially zero. Simplification set additionally 19 variables to zero. [2025-04-26 16:21:31,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:31,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:31,526 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:31,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:21:31,528 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:31,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:21:31,544 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:21:31,544 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:31,544 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, sumThread1of1ForFork2_i) = 1*N - 1*sumThread1of1ForFork2_i Supporting invariants [1*N - 1*sumThread1of1ForFork2_hi >= 0] [2025-04-26 16:21:31,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:21:31,553 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:21:31,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:31,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:31,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:31,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:31,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:31,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:31,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:31,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:31,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:31,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:31,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:31,632 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:21:31,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:31,671 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:21:31,671 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2025-04-26 16:21:31,672 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23518 states and 116182 transitions. cyclomatic complexity: 94560 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (in total 11), 5 states have internal predecessors, (11), 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:21:32,311 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23518 states and 116182 transitions. cyclomatic complexity: 94560. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (in total 11), 5 states have internal predecessors, (11), 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 61335 states and 317353 transitions. Complement of second has 8 states. [2025-04-26 16:21:32,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:21:32,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (in total 11), 5 states have internal predecessors, (11), 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:21:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2025-04-26 16:21:32,313 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 155 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:21:32,313 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:32,313 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 155 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:21:32,313 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:32,313 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 155 transitions. Stem has 7 letters. Loop has 8 letters. [2025-04-26 16:21:32,313 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:32,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61335 states and 317353 transitions. [2025-04-26 16:21:33,412 INFO L131 ngComponentsAnalysis]: Automaton has 820 accepting balls. 3280 [2025-04-26 16:21:34,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61335 states to 44112 states and 228397 transitions. [2025-04-26 16:21:34,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10904 [2025-04-26 16:21:34,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13772 [2025-04-26 16:21:34,045 INFO L74 IsDeterministic]: Start isDeterministic. Operand 44112 states and 228397 transitions. [2025-04-26 16:21:34,045 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:34,045 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44112 states and 228397 transitions. [2025-04-26 16:21:34,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44112 states and 228397 transitions. [2025-04-26 16:21:34,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44112 to 38704. [2025-04-26 16:21:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38704 states, 38704 states have (on average 5.2579578338156265) internal successors, (in total 203504), 38703 states have internal predecessors, (203504), 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:21:35,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38704 states to 38704 states and 203504 transitions. [2025-04-26 16:21:35,494 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38704 states and 203504 transitions. [2025-04-26 16:21:35,494 INFO L438 stractBuchiCegarLoop]: Abstraction has 38704 states and 203504 transitions. [2025-04-26 16:21:35,494 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:21:35,494 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38704 states and 203504 transitions. [2025-04-26 16:21:35,904 INFO L131 ngComponentsAnalysis]: Automaton has 820 accepting balls. 3280 [2025-04-26 16:21:35,905 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:35,905 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:35,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:35,905 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:21:35,906 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]" "[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]" "[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]" "[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:21:35,906 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:21:35,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:35,906 INFO L85 PathProgramCache]: Analyzing trace with hash -63477976, now seen corresponding path program 1 times [2025-04-26 16:21:35,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:35,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428461726] [2025-04-26 16:21:35,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:35,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:35,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:35,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:35,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:35,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:35,914 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:35,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:35,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:35,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:35,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:35,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:35,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:35,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2741796, now seen corresponding path program 1 times [2025-04-26 16:21:35,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:35,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677528996] [2025-04-26 16:21:35,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:35,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:35,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:35,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:35,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:35,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:35,934 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:35,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:35,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:35,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:35,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:35,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:35,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:35,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1233432117, now seen corresponding path program 1 times [2025-04-26 16:21:35,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:35,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250459324] [2025-04-26 16:21:35,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:35,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:35,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:21:35,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:21:35,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:35,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:35,951 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:35,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:21:35,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:21:35,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:35,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:35,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:36,144 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:36,145 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:36,145 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:36,145 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:36,145 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:36,145 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:36,145 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:36,145 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:36,145 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-tailsum4.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:21:36,145 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:36,145 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:36,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:36,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:36,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:36,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:36,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:36,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:36,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:36,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:36,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:36,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:36,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:36,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:36,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:36,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:36,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:36,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:36,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:36,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:36,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:36,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:36,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:36,411 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:36,411 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:36,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:36,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:36,413 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:36,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:21:36,416 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:21:36,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:36,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:36,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:36,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:36,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:36,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:36,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:36,428 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:36,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:21:36,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:36,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:36,435 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:36,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:21:36,437 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:21:36,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:36,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:36,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:36,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:36,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:36,448 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:36,451 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:36,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:21:36,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:36,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:36,458 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:36,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:21:36,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:21:36,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:36,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:36,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:36,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:36,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:36,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:36,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:36,472 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:36,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:36,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:36,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:36,480 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:36,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:21:36,483 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:21:36,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:36,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:36,493 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:36,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:36,498 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:21:36,498 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:36,513 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:36,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:36,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:36,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:36,521 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:36,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:21:36,523 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:21:36,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:36,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:36,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:36,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:36,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:36,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:36,545 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:36,560 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 16:21:36,560 INFO L437 ModelExtractionUtils]: 12 out of 40 variables were initially zero. Simplification set additionally 25 variables to zero. [2025-04-26 16:21:36,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:36,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:36,562 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:36,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:21:36,564 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:36,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:21:36,579 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:36,579 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:36,579 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:21:36,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:36,586 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:36,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:36,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:36,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:36,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:36,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:36,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:36,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:36,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:36,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:36,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:36,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:36,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:36,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:36,639 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:21:36,639 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:21:36,640 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38704 states and 203504 transitions. cyclomatic complexity: 167230 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 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:21:37,611 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38704 states and 203504 transitions. cyclomatic complexity: 167230. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 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 92271 states and 495015 transitions. Complement of second has 6 states. [2025-04-26 16:21:37,611 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:21:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 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:21:37,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-04-26 16:21:37,612 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:21:37,612 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:37,612 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 16:21:37,612 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:37,612 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 8 letters. Loop has 8 letters. [2025-04-26 16:21:37,613 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:37,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92271 states and 495015 transitions. [2025-04-26 16:21:39,279 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:39,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92271 states to 0 states and 0 transitions. [2025-04-26 16:21:39,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:21:39,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:21:39,280 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:21:39,280 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:21:39,280 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:39,280 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:39,280 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:39,280 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:21:39,280 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:21:39,280 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:39,280 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:21:39,286 INFO L201 PluginConnector]: Adding new model max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:21:39 BoogieIcfgContainer [2025-04-26 16:21:39,286 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:21:39,287 INFO L158 Benchmark]: Toolchain (without parser) took 16273.78ms. Allocated memory was 155.2MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 82.4MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-04-26 16:21:39,287 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:39,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.46ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 80.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:39,287 INFO L158 Benchmark]: Boogie Preprocessor took 28.97ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 79.6MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:21:39,291 INFO L158 Benchmark]: RCFGBuilder took 162.31ms. Allocated memory is still 155.2MB. Free memory was 79.4MB in the beginning and 69.5MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:21:39,291 INFO L158 Benchmark]: BuchiAutomizer took 16041.88ms. Allocated memory was 155.2MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 69.5MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-04-26 16:21:39,292 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.15ms. Allocated memory is still 155.2MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.46ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 80.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 28.97ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 79.6MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 162.31ms. Allocated memory is still 155.2MB. Free memory was 79.4MB in the beginning and 69.5MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 16041.88ms. Allocated memory was 155.2MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 69.5MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.1s. Construction of modules took 0.1s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 3.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 12870 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 4.9s Buchi closure took 0.1s. 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, 448 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 445 mSDsluCounter, 718 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 354 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 147 IncrementalHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 364 mSDtfsCounter, 147 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital100 mio100 ax100 hnf100 lsp109 ukn67 mio100 lsp58 div100 bol100 ite100 ukn100 eq172 hnf92 smp100 dnf167 smp64 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 69ms 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.0s InitialAbstraction: - 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 + N and consists of 6 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:21:39,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...