/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-tailsum5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:21:24,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:21:24,390 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:24,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:21:24,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:21:24,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:21:24,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:21:24,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:21:24,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:21:24,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:21:24,415 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:21:24,415 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:21:24,415 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:21:24,415 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:21:24,415 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:21:24,415 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:21:24,415 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:21:24,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:21:24,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:21:24,416 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:21:24,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:21:24,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:21:24,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:21:24,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:21:24,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:21:24,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:21:24,416 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:21:24,416 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:21:24,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:21:24,416 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:21:24,416 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:21:24,416 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:21:24,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:21:24,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:21:24,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:21:24,417 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:21:24,417 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:21:24,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:21:24,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:21:24,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:21:24,659 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:21:24,660 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:21:24,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum5.bpl [2025-04-26 16:21:24,661 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum5.bpl' [2025-04-26 16:21:24,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:21:24,677 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:21:24,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:24,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:21:24,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:21:24,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:24" (1/1) ... [2025-04-26 16:21:24,709 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:24" (1/1) ... [2025-04-26 16:21:24,718 INFO L138 Inliner]: procedures = 3, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:21:24,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:24,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:21:24,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:21:24,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:21:24,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:24" (1/1) ... [2025-04-26 16:21:24,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:24" (1/1) ... [2025-04-26 16:21:24,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:24" (1/1) ... [2025-04-26 16:21:24,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:24" (1/1) ... [2025-04-26 16:21:24,734 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:24" (1/1) ... [2025-04-26 16:21:24,734 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:24" (1/1) ... [2025-04-26 16:21:24,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:24" (1/1) ... [2025-04-26 16:21:24,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:24" (1/1) ... [2025-04-26 16:21:24,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:24" (1/1) ... [2025-04-26 16:21:24,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:21:24,749 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:21:24,749 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:21:24,749 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:21:24,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:24" (1/1) ... [2025-04-26 16:21:24,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:24,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:24,778 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:24,781 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:24,802 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:21:24,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:21:24,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:21:24,802 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2025-04-26 16:21:24,802 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2025-04-26 16:21:24,802 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2025-04-26 16:21:24,803 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:24,844 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:21:24,846 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:21:24,957 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:21:24,957 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:21:24,966 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:21:24,966 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:21:24,966 INFO L201 PluginConnector]: Adding new model max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:24 BoogieIcfgContainer [2025-04-26 16:21:24,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:21:24,967 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:21:24,968 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:21:24,974 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:21:24,975 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:24,975 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:24" (1/2) ... [2025-04-26 16:21:24,977 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a57289d and model type max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:21:24, skipping insertion in model container [2025-04-26 16:21:24,977 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:24,977 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:24" (2/2) ... [2025-04-26 16:21:24,978 INFO L376 chiAutomizerObserver]: Analyzing ICFG max-tailsum5.bpl [2025-04-26 16:21:25,071 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 16:21:25,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 69 transitions, 173 flow [2025-04-26 16:21:25,147 INFO L116 PetriNetUnfolderBase]: 5/59 cut-off events. [2025-04-26 16:21:25,150 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 16:21:25,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 59 events. 5/59 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 178 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2025-04-26 16:21:25,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 69 transitions, 173 flow [2025-04-26 16:21:25,163 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 59 transitions, 148 flow [2025-04-26 16:21:25,163 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 70 places, 59 transitions, 148 flow [2025-04-26 16:21:25,172 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:21:25,172 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:21:25,172 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:21:25,172 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:21:25,173 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:21:25,173 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:21:25,173 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:21:25,173 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:21:25,174 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:21:29,963 INFO L131 ngComponentsAnalysis]: Automaton has 6199 accepting balls. 69124 [2025-04-26 16:21:29,964 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:29,964 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:29,969 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:29,969 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:21:29,969 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:21:29,970 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 73814 states, but on-demand construction may add more states [2025-04-26 16:21:31,509 INFO L131 ngComponentsAnalysis]: Automaton has 6199 accepting balls. 69124 [2025-04-26 16:21:31,509 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:31,509 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:31,512 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:31,512 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:21:31,517 INFO L752 eck$LassoCheckResult]: Stem: "[47] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_ULTIMATE.start_k4_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= v_ULTIMATE.start_k4_1 v_N_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1, ULTIMATE.start_k4=v_ULTIMATE.start_k4_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1, ULTIMATE.start_k4=v_ULTIMATE.start_k4_1} AuxVars[] AssignedVars[]" "[97] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo]" "[50] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork0_x_1 0) InVars {} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_x]" "[51] L28-->L30: Formula: (= v_sumThread1of1ForFork0_z_1 0) InVars {} OutVars{sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_z]" "[52] L30-->L31-1: Formula: (= v_sumThread1of1ForFork0_i_1 v_sumThread1of1ForFork0_lo_1) InVars {sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_1} OutVars{sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_1, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_i]" [2025-04-26 16:21:31,517 INFO L754 eck$LassoCheckResult]: Loop: "[54] L31-1-->L32: Formula: (< v_sumThread1of1ForFork0_i_5 v_sumThread1of1ForFork0_hi_3) InVars {sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_5} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_5} AuxVars[] AssignedVars[]" "[56] L32-->L33: Formula: (= (+ v_sumThread1of1ForFork0_x_3 (select v_A_1 v_sumThread1of1ForFork0_i_7)) v_sumThread1of1ForFork0_x_4) InVars {A=v_A_1, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_7} OutVars{A=v_A_1, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_4, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_7} AuxVars[] AssignedVars[sumThread1of1ForFork0_x]" "[57] L33-->L34: Formula: (= (+ v_sumThread1of1ForFork0_i_9 1) v_sumThread1of1ForFork0_i_10) InVars {sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_9} OutVars{sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_10} AuxVars[] AssignedVars[sumThread1of1ForFork0_i]" "[58] L34-->L31-1: Formula: (= (let ((.cse0 (+ (select v_A_2 v_sumThread1of1ForFork0_i_13) v_sumThread1of1ForFork0_z_3))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork0_z_4) InVars {A=v_A_2, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_13} OutVars{A=v_A_2, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_4, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_13} AuxVars[] AssignedVars[sumThread1of1ForFork0_z]" [2025-04-26 16:21:31,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:31,521 INFO L85 PathProgramCache]: Analyzing trace with hash 74974048, now seen corresponding path program 1 times [2025-04-26 16:21:31,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:31,527 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377387362] [2025-04-26 16:21:31,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:31,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:31,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:31,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:31,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:31,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:31,579 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:31,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:31,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:31,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:31,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:31,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:31,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:31,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2587876, now seen corresponding path program 1 times [2025-04-26 16:21:31,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:31,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550708661] [2025-04-26 16:21:31,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:31,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:31,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:31,621 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,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:31,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:31,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:31,626 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 sat [2025-04-26 16:21:31,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:31,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:31,638 INFO L85 PathProgramCache]: Analyzing trace with hash 941668547, now seen corresponding path program 1 times [2025-04-26 16:21:31,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:31,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680930668] [2025-04-26 16:21:31,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:31,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:31,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:21:31,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:21:31,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:31,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:31,658 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:31,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:21:31,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:21:31,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:31,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:31,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:31,874 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:31,874 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:31,874 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:31,874 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:31,875 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:31,875 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:31,875 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:31,875 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:31,875 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-tailsum5.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:21:31,875 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:31,876 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:31,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:32,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:32,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:32,273 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:32,275 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:32,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:32,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:32,285 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:32,295 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:32,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:32,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:32,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:32,315 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:32,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:32,349 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:21:32,350 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:32,368 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:32,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:21:32,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:32,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:32,384 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:32,394 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:32,394 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:32,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:32,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:32,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:32,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:32,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:32,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:32,443 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:32,462 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:21:32,462 INFO L437 ModelExtractionUtils]: 8 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. [2025-04-26 16:21:32,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:32,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:32,473 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:32,475 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:32,478 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:32,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:32,510 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:32,511 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:32,511 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:32,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:32,529 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:32,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:32,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:32,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:32,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:32,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:32,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:32,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:32,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:32,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:32,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:32,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:32,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:32,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:32,770 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:32,814 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:32,820 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 73814 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:36,065 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 73814 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 169766 states and 933193 transitions. Complement of second has 6 states. [2025-04-26 16:21:36,067 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:36,070 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:36,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2025-04-26 16:21:36,074 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 182 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:21:36,075 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:36,075 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 182 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:21:36,075 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:36,075 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 182 transitions. Stem has 5 letters. Loop has 8 letters. [2025-04-26 16:21:36,075 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:36,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169766 states and 933193 transitions. [2025-04-26 16:21:40,104 INFO L131 ngComponentsAnalysis]: Automaton has 7740 accepting balls. 66000 [2025-04-26 16:21:43,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169766 states to 147282 states and 814392 transitions. [2025-04-26 16:21:43,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80999 [2025-04-26 16:21:43,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110458 [2025-04-26 16:21:43,763 INFO L74 IsDeterministic]: Start isDeterministic. Operand 147282 states and 814392 transitions. [2025-04-26 16:21:43,764 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:43,764 INFO L218 hiAutomatonCegarLoop]: Abstraction has 147282 states and 814392 transitions. [2025-04-26 16:21:44,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147282 states and 814392 transitions. [2025-04-26 16:21:48,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147282 to 117825. [2025-04-26 16:21:48,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117825 states, 117825 states have (on average 5.602741353702525) internal successors, (in total 660143), 117824 states have internal predecessors, (660143), 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:50,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117825 states to 117825 states and 660143 transitions. [2025-04-26 16:21:50,463 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117825 states and 660143 transitions. [2025-04-26 16:21:50,463 INFO L438 stractBuchiCegarLoop]: Abstraction has 117825 states and 660143 transitions. [2025-04-26 16:21:50,463 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:21:50,463 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117825 states and 660143 transitions. [2025-04-26 16:21:51,825 INFO L131 ngComponentsAnalysis]: Automaton has 7740 accepting balls. 66000 [2025-04-26 16:21:51,825 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:51,825 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:51,829 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:21:51,829 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:21:51,830 INFO L752 eck$LassoCheckResult]: Stem: "[47] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_ULTIMATE.start_k4_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= v_ULTIMATE.start_k4_1 v_N_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1, ULTIMATE.start_k4=v_ULTIMATE.start_k4_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1, ULTIMATE.start_k4=v_ULTIMATE.start_k4_1} AuxVars[] AssignedVars[]" "[97] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo]" "[100] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= v_ULTIMATE.start_k2_3 v_sumThread1of1ForFork1_hi_6) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_16, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_8, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_hi, sumThread1of1ForFork1_z, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_thidvar1, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x, sumThread1of1ForFork1_lo]" "[77] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork1_x_1 0) InVars {} OutVars{sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_x]" "[78] L28-->L30: Formula: (= v_sumThread1of1ForFork1_z_1 0) InVars {} OutVars{sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_z]" "[79] L30-->L31-1: Formula: (= v_sumThread1of1ForFork1_i_1 v_sumThread1of1ForFork1_lo_1) InVars {sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_1} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_1, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_i]" [2025-04-26 16:21:51,830 INFO L754 eck$LassoCheckResult]: Loop: "[81] L31-1-->L32: Formula: (< v_sumThread1of1ForFork1_i_5 v_sumThread1of1ForFork1_hi_3) InVars {sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_5, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_3} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_5, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_3} AuxVars[] AssignedVars[]" "[83] L32-->L33: Formula: (= (+ (select v_A_1 v_sumThread1of1ForFork1_i_7) v_sumThread1of1ForFork1_x_3) v_sumThread1of1ForFork1_x_4) InVars {A=v_A_1, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_7, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_3} OutVars{A=v_A_1, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_7, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_x]" "[84] L33-->L34: Formula: (= (+ v_sumThread1of1ForFork1_i_9 1) v_sumThread1of1ForFork1_i_10) InVars {sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_9} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_10} AuxVars[] AssignedVars[sumThread1of1ForFork1_i]" "[85] L34-->L31-1: Formula: (= v_sumThread1of1ForFork1_z_4 (let ((.cse0 (+ (select v_A_2 v_sumThread1of1ForFork1_i_13) v_sumThread1of1ForFork1_z_3))) (ite (< 0 .cse0) .cse0 0))) InVars {A=v_A_2, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_13} OutVars{A=v_A_2, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_4, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_13} AuxVars[] AssignedVars[sumThread1of1ForFork1_z]" [2025-04-26 16:21:51,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:51,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1969256387, now seen corresponding path program 1 times [2025-04-26 16:21:51,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:51,831 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137026014] [2025-04-26 16:21:51,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:51,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:51,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:51,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:51,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,838 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:51,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:51,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:51,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:51,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:51,850 INFO L85 PathProgramCache]: Analyzing trace with hash 3419044, now seen corresponding path program 1 times [2025-04-26 16:21:51,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:51,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449060617] [2025-04-26 16:21:51,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:51,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:51,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:51,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:51,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,860 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:51,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:51,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:51,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:51,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:51,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1558366752, now seen corresponding path program 1 times [2025-04-26 16:21:51,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:51,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418552334] [2025-04-26 16:21:51,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:51,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:51,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:51,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:51,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,891 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:51,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:51,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:51,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:52,066 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:52,067 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:52,067 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:52,067 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:52,067 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:52,067 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,067 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:52,067 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:52,067 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-tailsum5.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:21:52,067 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:52,067 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:52,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,303 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:52,303 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:52,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,305 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:52,306 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:52,312 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:52,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,341 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,348 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:52,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,351 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:52,352 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:52,358 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:52,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,390 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,396 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:52,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,398 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:52,400 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:52,401 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:52,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:52,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:52,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:52,413 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:21:52,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,420 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:52,421 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:52,422 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:52,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:52,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:52,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:52,433 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,439 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:52,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,441 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:52,441 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:52,443 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:52,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,478 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:52,496 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:21:52,496 INFO L437 ModelExtractionUtils]: 9 out of 31 variables were initially zero. Simplification set additionally 19 variables to zero. [2025-04-26 16:21:52,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,499 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:52,503 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:52,507 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:52,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:21:52,520 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:52,520 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:52,521 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:52,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:21:52,529 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:52,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:52,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:52,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:52,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:52,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:52,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:52,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:52,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:52,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:52,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:52,598 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:52,598 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:52,599 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117825 states and 660143 transitions. cyclomatic complexity: 551597 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:57,471 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117825 states and 660143 transitions. cyclomatic complexity: 551597. 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 299116 states and 1803874 transitions. Complement of second has 6 states. [2025-04-26 16:21:57,472 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:57,472 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:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2025-04-26 16:21:57,473 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 178 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:21:57,473 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:57,473 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 178 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:21:57,473 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:57,473 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 178 transitions. Stem has 6 letters. Loop has 8 letters. [2025-04-26 16:21:57,473 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:57,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 299116 states and 1803874 transitions. [2025-04-26 16:22:05,509 INFO L131 ngComponentsAnalysis]: Automaton has 9265 accepting balls. 59884 [2025-04-26 16:22:10,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 299116 states to 258917 states and 1564736 transitions. [2025-04-26 16:22:10,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95716 [2025-04-26 16:22:11,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 127830 [2025-04-26 16:22:11,101 INFO L74 IsDeterministic]: Start isDeterministic. Operand 258917 states and 1564736 transitions. [2025-04-26 16:22:11,101 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:11,102 INFO L218 hiAutomatonCegarLoop]: Abstraction has 258917 states and 1564736 transitions. [2025-04-26 16:22:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258917 states and 1564736 transitions. [2025-04-26 16:22:18,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258917 to 219499. [2025-04-26 16:22:18,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219499 states, 219499 states have (on average 6.177946140984697) internal successors, (in total 1356053), 219498 states have internal predecessors, (1356053), 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:22:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219499 states to 219499 states and 1356053 transitions. [2025-04-26 16:22:21,275 INFO L240 hiAutomatonCegarLoop]: Abstraction has 219499 states and 1356053 transitions. [2025-04-26 16:22:21,275 INFO L438 stractBuchiCegarLoop]: Abstraction has 219499 states and 1356053 transitions. [2025-04-26 16:22:21,275 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:22:21,280 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 219499 states and 1356053 transitions. [2025-04-26 16:22:23,960 INFO L131 ngComponentsAnalysis]: Automaton has 9265 accepting balls. 59884 [2025-04-26 16:22:23,960 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:23,960 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:23,965 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:23,965 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:22:23,965 INFO L752 eck$LassoCheckResult]: Stem: "[47] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_ULTIMATE.start_k4_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= v_ULTIMATE.start_k4_1 v_N_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1, ULTIMATE.start_k4=v_ULTIMATE.start_k4_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1, ULTIMATE.start_k4=v_ULTIMATE.start_k4_1} AuxVars[] AssignedVars[]" "[97] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo]" "[100] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= v_ULTIMATE.start_k2_3 v_sumThread1of1ForFork1_hi_6) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_16, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_8, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_hi, sumThread1of1ForFork1_z, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_thidvar1, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x, sumThread1of1ForFork1_lo]" "[103] L55-->$Ultimate##0: Formula: (and (= 3 v_sumThread1of1ForFork2_thidvar1_2) (= 3 v_sumThread1of1ForFork2_thidvar0_2) (= 3 v_sumThread1of1ForFork2_thidvar2_2) (= v_ULTIMATE.start_k3_3 v_sumThread1of1ForFork2_hi_6) (= v_sumThread1of1ForFork2_lo_4 (+ v_ULTIMATE.start_k2_5 1))) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_3, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5} OutVars{sumThread1of1ForFork2_thidvar0=v_sumThread1of1ForFork2_thidvar0_2, sumThread1of1ForFork2_thidvar1=v_sumThread1of1ForFork2_thidvar1_2, sumThread1of1ForFork2_thidvar2=v_sumThread1of1ForFork2_thidvar2_2, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_8, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_16, ULTIMATE.start_k3=v_ULTIMATE.start_k3_3, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_8, sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_4, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_6} AuxVars[] AssignedVars[sumThread1of1ForFork2_thidvar0, sumThread1of1ForFork2_thidvar1, sumThread1of1ForFork2_thidvar2, sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x, sumThread1of1ForFork2_lo, sumThread1of1ForFork2_hi]" "[86] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork2_x_1 0) InVars {} OutVars{sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork2_x]" "[87] L28-->L30: Formula: (= v_sumThread1of1ForFork2_z_1 0) InVars {} OutVars{sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork2_z]" "[88] L30-->L31-1: Formula: (= v_sumThread1of1ForFork2_i_1 v_sumThread1of1ForFork2_lo_1) InVars {sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_1} OutVars{sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_1, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_1} AuxVars[] AssignedVars[sumThread1of1ForFork2_i]" [2025-04-26 16:22:23,966 INFO L754 eck$LassoCheckResult]: Loop: "[90] L31-1-->L32: Formula: (< v_sumThread1of1ForFork2_i_5 v_sumThread1of1ForFork2_hi_3) InVars {sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_3, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_5} OutVars{sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_3, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_5} AuxVars[] AssignedVars[]" "[92] L32-->L33: Formula: (= v_sumThread1of1ForFork2_x_4 (+ (select v_A_1 v_sumThread1of1ForFork2_i_7) v_sumThread1of1ForFork2_x_3)) InVars {A=v_A_1, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_7, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_3} OutVars{A=v_A_1, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_7, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_4} AuxVars[] AssignedVars[sumThread1of1ForFork2_x]" "[93] L33-->L34: Formula: (= (+ v_sumThread1of1ForFork2_i_9 1) v_sumThread1of1ForFork2_i_10) InVars {sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_9} OutVars{sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_10} AuxVars[] AssignedVars[sumThread1of1ForFork2_i]" "[94] L34-->L31-1: Formula: (= v_sumThread1of1ForFork2_z_4 (let ((.cse0 (+ (select v_A_2 v_sumThread1of1ForFork2_i_13) v_sumThread1of1ForFork2_z_3))) (ite (< 0 .cse0) .cse0 0))) InVars {A=v_A_2, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_3, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_13} OutVars{A=v_A_2, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_4, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_13} AuxVars[] AssignedVars[sumThread1of1ForFork2_z]" [2025-04-26 16:22:23,966 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,966 INFO L85 PathProgramCache]: Analyzing trace with hash -916623263, now seen corresponding path program 1 times [2025-04-26 16:22:23,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,966 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224926124] [2025-04-26 16:22:23,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:23,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:22:23,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:22:23,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:23,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:22:23,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:22:23,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:23,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,981 INFO L85 PathProgramCache]: Analyzing trace with hash 3696100, now seen corresponding path program 1 times [2025-04-26 16:22:23,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201371962] [2025-04-26 16:22:23,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:23,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:23,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:23,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,985 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:23,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:23,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:23,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:23,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,990 INFO L85 PathProgramCache]: Analyzing trace with hash 44475972, now seen corresponding path program 1 times [2025-04-26 16:22:23,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200781027] [2025-04-26 16:22:23,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:23,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:23,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:23,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:23,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:24,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:24,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:24,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:24,183 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:24,183 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:24,183 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:24,183 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:24,183 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:24,183 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,183 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:24,183 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:24,183 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-tailsum5.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:22:24,184 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:24,184 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:24,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,425 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:24,425 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:24,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,428 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:22:24,429 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:22:24,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:24,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:24,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:24,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:24,442 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:24,448 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:22:24,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,450 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:22:24,451 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:22:24,453 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:22:24,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:24,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:24,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:24,464 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:24,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:24,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,471 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:22:24,475 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:22:24,475 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:22:24,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:24,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:24,489 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:24,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:22:24,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,497 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:22:24,497 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:22:24,498 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:22:24,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:24,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:24,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:24,509 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:24,514 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:22:24,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,516 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:22:24,517 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:22:24,517 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:22:24,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:24,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:24,531 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:24,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:22:24,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,538 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:22:24,540 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:22:24,541 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:22:24,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:24,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:24,554 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:24,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:24,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,585 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:22:24,586 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:22:24,587 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:22:24,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:24,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:24,604 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:24,609 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:22:24,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,612 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:22:24,613 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:22:24,614 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:22:24,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:24,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:24,628 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:24,634 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:22:24,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,636 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:22:24,638 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:22:24,639 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:22:24,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:24,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:24,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:24,651 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:24,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:24,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,659 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:22:24,660 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:22:24,660 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:22:24,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:24,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:24,673 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:24,678 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:22:24,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,681 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:22:24,682 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:22:24,683 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:22:24,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:24,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:24,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:24,694 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:24,699 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:22:24,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,701 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:22:24,702 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:22:24,703 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:22:24,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,713 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:24,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,723 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:22:24,724 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:24,734 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:24,739 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:22:24,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,742 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:22:24,743 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:22:24,744 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:22:24,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:24,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:24,768 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:24,782 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:22:24,783 INFO L437 ModelExtractionUtils]: 11 out of 37 variables were initially zero. Simplification set additionally 23 variables to zero. [2025-04-26 16:22:24,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,785 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:22:24,786 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:22:24,787 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:24,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:24,804 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:24,805 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:24,805 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork2_i, sumThread1of1ForFork2_hi) = -1*sumThread1of1ForFork2_i + 1*sumThread1of1ForFork2_hi Supporting invariants [] [2025-04-26 16:22:24,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:24,812 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:24,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:24,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:22:24,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:22:24,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:24,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:24,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:24,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:24,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:24,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:24,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:24,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:24,874 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:22:24,875 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:22:24,875 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 219499 states and 1356053 transitions. cyclomatic complexity: 1151048 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 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)