/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-tailsum2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:21:20,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:21:20,798 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:20,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:21:20,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:21:20,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:21:20,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:21:20,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:21:20,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:21:20,825 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:21:20,825 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:21:20,825 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:21:20,825 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:21:20,826 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:21:20,826 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:21:20,826 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:21:20,826 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:21:20,826 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:21:20,826 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:21:20,826 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:21:20,826 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:21:20,826 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:21:20,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:21:20,826 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:21:20,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:21:20,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:21:20,826 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:21:20,826 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:21:20,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:21:20,826 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:21:20,826 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:21:20,827 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:21:20,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:21:20,827 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:21:20,827 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:21:20,827 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:21:20,827 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:21:21,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:21:21,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:21:21,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:21:21,034 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:21:21,034 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:21:21,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum2.bpl [2025-04-26 16:21:21,036 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum2.bpl' [2025-04-26 16:21:21,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:21:21,054 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:21:21,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:21,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:21:21,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:21:21,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,090 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:21:21,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:21,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:21:21,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:21:21,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:21:21,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,102 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,103 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:21:21,113 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:21:21,113 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:21:21,113 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:21:21,116 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/1) ... [2025-04-26 16:21:21,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:21,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:21,140 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:21,143 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:21,166 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:21:21,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:21:21,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:21:21,167 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2025-04-26 16:21:21,167 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2025-04-26 16:21:21,167 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2025-04-26 16:21:21,167 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:21,204 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:21:21,205 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:21:21,258 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:21:21,258 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:21:21,268 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:21:21,268 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:21:21,269 INFO L201 PluginConnector]: Adding new model max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:21 BoogieIcfgContainer [2025-04-26 16:21:21,269 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:21:21,269 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:21:21,269 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:21:21,273 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:21:21,273 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:21,274 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:21" (1/2) ... [2025-04-26 16:21:21,274 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14cfc454 and model type max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:21:21, skipping insertion in model container [2025-04-26 16:21:21,274 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:21,275 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:21" (2/2) ... [2025-04-26 16:21:21,276 INFO L376 chiAutomizerObserver]: Analyzing ICFG max-tailsum2.bpl [2025-04-26 16:21:21,334 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:21:21,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 74 flow [2025-04-26 16:21:21,386 INFO L116 PetriNetUnfolderBase]: 2/26 cut-off events. [2025-04-26 16:21:21,387 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:21:21,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 2/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-26 16:21:21,390 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 30 transitions, 74 flow [2025-04-26 16:21:21,394 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 26 transitions, 64 flow [2025-04-26 16:21:21,394 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 31 places, 26 transitions, 64 flow [2025-04-26 16:21:21,402 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:21:21,402 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:21:21,402 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:21:21,402 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:21:21,403 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:21:21,403 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:21:21,403 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:21:21,403 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:21:21,404 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:21:21,442 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 64 [2025-04-26 16:21:21,442 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:21,442 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:21,445 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:21,445 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:21:21,445 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:21:21,445 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 104 states, but on-demand construction may add more states [2025-04-26 16:21:21,449 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 64 [2025-04-26 16:21:21,449 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:21,449 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:21,449 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:21,449 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:21:21,453 INFO L752 eck$LassoCheckResult]: Stem: "[34] $Ultimate##0-->L54: Formula: (and (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k1_1 v_N_1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[58] 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]" "[38] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork0_x_1 0) InVars {} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_x]" "[39] L28-->L30: Formula: (= v_sumThread1of1ForFork0_z_1 0) InVars {} OutVars{sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_z]" "[40] 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:21,453 INFO L754 eck$LassoCheckResult]: Loop: "[42] 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[]" "[44] L32-->L33: Formula: (= v_sumThread1of1ForFork0_x_4 (+ (select v_A_2 v_sumThread1of1ForFork0_i_7) v_sumThread1of1ForFork0_x_3)) InVars {A=v_A_2, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_7} OutVars{A=v_A_2, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_4, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_7} AuxVars[] AssignedVars[sumThread1of1ForFork0_x]" "[45] 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]" "[46] L34-->L31-1: Formula: (= v_sumThread1of1ForFork0_z_4 (let ((.cse0 (+ (select v_A_1 v_sumThread1of1ForFork0_i_13) v_sumThread1of1ForFork0_z_3))) (ite (< 0 .cse0) .cse0 0))) InVars {A=v_A_1, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_13} OutVars{A=v_A_1, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_4, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_13} AuxVars[] AssignedVars[sumThread1of1ForFork0_z]" [2025-04-26 16:21:21,456 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:21,457 INFO L85 PathProgramCache]: Analyzing trace with hash 61794510, now seen corresponding path program 1 times [2025-04-26 16:21:21,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:21,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661751767] [2025-04-26 16:21:21,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:21,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:21,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:21,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:21,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:21,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:21,508 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:21,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:21,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:21,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:21,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:21,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:21,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:21,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2218468, now seen corresponding path program 1 times [2025-04-26 16:21:21,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:21,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904847176] [2025-04-26 16:21:21,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:21,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:21,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:21,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:21,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:21,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:21,535 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:21,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:21,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:21,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:21,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:21,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:21,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:21,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1298502705, now seen corresponding path program 1 times [2025-04-26 16:21:21,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:21,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793823828] [2025-04-26 16:21:21,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:21,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:21,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:21:21,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:21:21,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:21,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:21,565 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:21,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:21:21,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:21:21,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:21,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:21,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:21,788 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:21,789 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:21,789 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:21,789 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:21,789 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:21,789 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:21,789 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:21,789 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:21,789 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-tailsum2.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:21:21,789 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:21,789 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:21,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:21,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:21,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:22,029 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:22,031 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:22,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:22,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:22,034 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:22,035 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:22,036 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:22,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:22,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:22,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:22,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:22,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:22,054 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:22,060 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:22,067 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:22,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:22,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:22,070 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:22,071 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:22,073 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:22,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:22,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:22,084 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:22,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:22,124 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:21:22,124 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:22,145 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:22,153 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:22,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:22,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:22,155 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:22,155 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:22,157 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:22,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:22,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:22,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:22,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:22,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:22,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:22,179 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:22,195 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:21:22,195 INFO L437 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:21:22,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:22,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:22,199 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:22,201 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:22,202 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:22,219 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:22,220 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:22,220 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:22,220 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:22,227 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:22,229 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:22,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:22,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:22,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:22,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:22,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:22,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:22,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:22,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:22,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:22,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:22,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:22,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:22,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:22,376 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:22,401 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:22,403 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 104 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:22,475 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 104 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 233 states and 515 transitions. Complement of second has 6 states. [2025-04-26 16:21:22,477 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:22,480 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:22,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-04-26 16:21:22,486 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:21:22,486 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:22,487 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:21:22,487 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:22,487 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 5 letters. Loop has 8 letters. [2025-04-26 16:21:22,487 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:22,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 233 states and 515 transitions. [2025-04-26 16:21:22,493 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 40 [2025-04-26 16:21:22,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 233 states to 156 states and 349 transitions. [2025-04-26 16:21:22,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2025-04-26 16:21:22,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2025-04-26 16:21:22,500 INFO L74 IsDeterministic]: Start isDeterministic. Operand 156 states and 349 transitions. [2025-04-26 16:21:22,500 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:22,500 INFO L218 hiAutomatonCegarLoop]: Abstraction has 156 states and 349 transitions. [2025-04-26 16:21:22,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 349 transitions. [2025-04-26 16:21:22,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 127. [2025-04-26 16:21:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 127 states have (on average 2.236220472440945) internal successors, (in total 284), 126 states have internal predecessors, (284), 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:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 284 transitions. [2025-04-26 16:21:22,523 INFO L240 hiAutomatonCegarLoop]: Abstraction has 127 states and 284 transitions. [2025-04-26 16:21:22,523 INFO L438 stractBuchiCegarLoop]: Abstraction has 127 states and 284 transitions. [2025-04-26 16:21:22,523 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:21:22,523 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 284 transitions. [2025-04-26 16:21:22,529 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 40 [2025-04-26 16:21:22,529 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:22,529 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:22,529 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:21:22,529 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:21:22,530 INFO L752 eck$LassoCheckResult]: Stem: "[34] $Ultimate##0-->L54: Formula: (and (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k1_1 v_N_1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[]" "[58] 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]" "[61] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2) (= v_N_3 v_sumThread1of1ForFork1_hi_6)) InVars {N=v_N_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{N=v_N_3, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, 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]" "[47] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork1_x_1 0) InVars {} OutVars{sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_x]" "[48] L28-->L30: Formula: (= v_sumThread1of1ForFork1_z_1 0) InVars {} OutVars{sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_z]" "[49] 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:22,530 INFO L754 eck$LassoCheckResult]: Loop: "[51] 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[]" "[53] L32-->L33: Formula: (= (+ v_sumThread1of1ForFork1_x_3 (select v_A_2 v_sumThread1of1ForFork1_i_7)) v_sumThread1of1ForFork1_x_4) InVars {A=v_A_2, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_7, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_3} OutVars{A=v_A_2, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_7, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_x]" "[54] 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]" "[55] L34-->L31-1: Formula: (= v_sumThread1of1ForFork1_z_4 (let ((.cse0 (+ v_sumThread1of1ForFork1_z_3 (select v_A_1 v_sumThread1of1ForFork1_i_13)))) (ite (< 0 .cse0) .cse0 0))) InVars {A=v_A_1, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_13} OutVars{A=v_A_1, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_4, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_13} AuxVars[] AssignedVars[sumThread1of1ForFork1_z]" [2025-04-26 16:21:22,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:22,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1916322988, now seen corresponding path program 1 times [2025-04-26 16:21:22,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:22,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484362434] [2025-04-26 16:21:22,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:22,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:22,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:22,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:22,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:22,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:22,543 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:22,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:22,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:22,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:22,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:22,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:22,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:22,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2495524, now seen corresponding path program 1 times [2025-04-26 16:21:22,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:22,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526308624] [2025-04-26 16:21:22,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:22,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:22,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:22,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:22,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:22,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:22,565 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:22,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:22,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:22,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:22,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:22,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:22,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:22,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1774619471, now seen corresponding path program 1 times [2025-04-26 16:21:22,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:22,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332611341] [2025-04-26 16:21:22,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:22,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:22,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:22,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:22,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:22,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:22,587 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:22,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:22,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:22,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:22,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:22,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:22,723 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:22,723 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:22,723 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:22,723 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:22,723 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:22,723 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:22,723 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:22,723 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:22,723 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-tailsum2.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:21:22,723 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:22,723 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:22,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:22,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:22,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:22,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:22,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:22,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:22,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:22,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:22,941 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:22,941 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:22,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:22,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:22,943 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:22,945 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:22,946 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:22,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:22,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:22,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:22,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:22,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:22,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:22,961 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:22,966 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:22,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:22,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:22,969 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:22,970 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:22,971 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:22,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:22,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:22,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:22,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:22,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:22,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:22,990 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:22,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:22,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:22,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:22,998 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:22,999 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:23,001 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:23,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:23,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:23,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:23,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:23,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:23,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:23,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:23,013 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:23,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:23,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:23,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:23,021 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:23,022 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:23,023 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:23,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:23,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:23,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:23,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:23,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:23,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:23,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:23,034 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:23,040 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:23,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:23,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:23,042 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:23,042 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:23,044 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:23,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:23,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:23,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:23,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:23,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:23,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:23,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:23,055 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:23,061 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:23,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:23,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:23,064 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:23,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:21:23,067 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:23,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:23,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:23,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:23,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:23,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:23,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:23,082 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:23,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:23,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:23,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:23,091 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:23,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:21:23,093 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:23,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:23,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:23,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:23,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:23,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:23,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:23,107 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:23,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:21:23,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:23,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:23,115 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:23,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:21:23,117 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:23,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:23,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:23,128 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:23,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:23,137 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:21:23,137 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:23,147 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:23,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:23,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:23,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:23,156 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:23,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:21:23,159 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:23,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:23,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:23,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:23,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:23,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:23,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:23,180 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:23,202 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 16:21:23,202 INFO L437 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-04-26 16:21:23,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:23,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:23,204 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:23,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:21:23,206 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:23,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:23,225 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:23,225 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:23,225 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork1_i, sumThread1of1ForFork1_hi) = -1*sumThread1of1ForFork1_i + 1*sumThread1of1ForFork1_hi Supporting invariants [] [2025-04-26 16:21:23,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:21:23,234 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:23,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:23,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:21:23,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:21:23,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:23,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:23,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:23,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:23,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:23,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:23,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:23,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:23,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:23,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:23,309 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:23,310 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:23,310 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 127 states and 284 transitions. cyclomatic complexity: 172 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:23,359 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 127 states and 284 transitions. cyclomatic complexity: 172. 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 280 states and 667 transitions. Complement of second has 6 states. [2025-04-26 16:21:23,361 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:23,362 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:23,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2025-04-26 16:21:23,362 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:21:23,363 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:23,363 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:21:23,363 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:23,363 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 6 letters. Loop has 8 letters. [2025-04-26 16:21:23,363 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:23,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 280 states and 667 transitions. [2025-04-26 16:21:23,366 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:23,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 280 states to 0 states and 0 transitions. [2025-04-26 16:21:23,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:21:23,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:21:23,367 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:21:23,367 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:21:23,367 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:23,367 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:23,367 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:23,367 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:21:23,367 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:21:23,367 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:23,367 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:21:23,372 INFO L201 PluginConnector]: Adding new model max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:21:23 BoogieIcfgContainer [2025-04-26 16:21:23,372 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:21:23,373 INFO L158 Benchmark]: Toolchain (without parser) took 2318.99ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 84.7MB in the beginning and 36.6MB in the end (delta: 48.2MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. [2025-04-26 16:21:23,373 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:23,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.63ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 82.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:23,373 INFO L158 Benchmark]: Boogie Preprocessor took 18.60ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 81.7MB in the end (delta: 950.9kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:21:23,373 INFO L158 Benchmark]: RCFGBuilder took 156.08ms. Allocated memory is still 159.4MB. Free memory was 81.7MB in the beginning and 73.0MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:21:23,375 INFO L158 Benchmark]: BuchiAutomizer took 2102.76ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.8MB in the beginning and 36.6MB in the end (delta: 36.3MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2025-04-26 16:21:23,376 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.63ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 82.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 18.60ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 81.7MB in the end (delta: 950.9kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 156.08ms. Allocated memory is still 159.4MB. Free memory was 81.7MB in the beginning and 73.0MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2102.76ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.8MB in the beginning and 36.6MB in the end (delta: 36.3MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 29 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 128 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 66 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital77 mio100 ax100 hnf100 lsp121 ukn63 mio100 lsp56 div100 bol100 ite100 ukn100 eq172 hnf94 smp100 dnf203 smp56 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 77ms VariablesStem: 2 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + hi and consists of 4 locations. One deterministic module has affine ranking function -1 * i + hi and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:21:23,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...