/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check false -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:00:27,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:00:27,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 01:00:27,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:00:27,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:00:27,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:00:27,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:00:27,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:00:27,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:00:27,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:00:27,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:00:27,176 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:00:27,177 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:00:27,177 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:00:27,177 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:00:27,177 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:00:27,178 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:00:27,178 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:00:27,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:00:27,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:00:27,178 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:00:27,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:00:27,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:00:27,179 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:00:27,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:00:27,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:00:27,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:00:27,180 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:00:27,181 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:00:27,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:00:27,181 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:00:27,181 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:00:27,182 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:00:27,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:00:27,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:00:27,182 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:00:27,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:00:27,183 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:00:27,183 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> false [2024-02-10 01:00:27,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:00:27,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:00:27,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:00:27,522 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:00:27,524 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:00:27,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum5.bpl [2024-02-10 01:00:27,526 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum5.bpl' [2024-02-10 01:00:27,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:00:27,586 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:00:27,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:00:27,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:00:27,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:00:27,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:27" (1/1) ... [2024-02-10 01:00:27,636 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:27" (1/1) ... [2024-02-10 01:00:27,668 INFO L138 Inliner]: procedures = 3, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 01:00:27,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:00:27,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:00:27,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:00:27,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:00:27,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:27" (1/1) ... [2024-02-10 01:00:27,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:27" (1/1) ... [2024-02-10 01:00:27,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:27" (1/1) ... [2024-02-10 01:00:27,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:27" (1/1) ... [2024-02-10 01:00:27,710 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:27" (1/1) ... [2024-02-10 01:00:27,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:27" (1/1) ... [2024-02-10 01:00:27,714 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:27" (1/1) ... [2024-02-10 01:00:27,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:27" (1/1) ... [2024-02-10 01:00:27,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:00:27,717 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:00:27,717 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:00:27,717 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:00:27,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:27" (1/1) ... [2024-02-10 01:00:27,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:27,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:00:27,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:00:27,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-10 01:00:27,900 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:00:27,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:00:27,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:00:27,901 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2024-02-10 01:00:27,901 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-02-10 01:00:27,901 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-02-10 01:00:27,902 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 01:00:27,977 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:00:27,978 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:00:28,085 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:00:28,091 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:00:28,091 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 01:00:28,093 INFO L201 PluginConnector]: Adding new model max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:00:28 BoogieIcfgContainer [2024-02-10 01:00:28,093 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:00:28,094 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:00:28,094 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:00:28,112 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:00:28,113 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:00:28,114 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:00:27" (1/2) ... [2024-02-10 01:00:28,115 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@383c66dc and model type max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:00:28, skipping insertion in model container [2024-02-10 01:00:28,116 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:00:28,116 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:00:28" (2/2) ... [2024-02-10 01:00:28,117 INFO L332 chiAutomizerObserver]: Analyzing ICFG max-tailsum5.bpl [2024-02-10 01:00:28,242 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-02-10 01:00:28,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 69 transitions, 173 flow [2024-02-10 01:00:28,329 INFO L124 PetriNetUnfolderBase]: 5/59 cut-off events. [2024-02-10 01:00:28,331 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-02-10 01:00:28,352 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. [2024-02-10 01:00:28,352 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 69 transitions, 173 flow [2024-02-10 01:00:28,357 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 59 transitions, 148 flow [2024-02-10 01:00:28,363 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:00:28,363 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:00:28,363 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:00:28,364 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:00:28,364 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:00:28,370 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:00:28,370 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:00:28,371 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:00:28,372 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 70 places, 59 transitions, 148 flow [2024-02-10 01:00:28,393 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:00:28,394 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-02-10 01:00:28,394 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 01:00:28,394 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:00:28,397 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:00:28,397 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 70 places, 59 transitions, 148 flow [2024-02-10 01:00:28,420 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:00:28,420 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-02-10 01:00:28,420 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 01:00:28,420 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:00:28,425 INFO L748 eck$LassoCheckResult]: Stem: 79#[$Ultimate##0]true [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[] 81#[L54]true [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] 83#[L54-1, $Ultimate##0]true [50] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork0_x_1 0) InVars {} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_x] 85#[L28, L54-1]true [51] L28-->L30: Formula: (= v_sumThread1of1ForFork0_z_1 0) InVars {} OutVars{sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_z] 87#[L54-1, L30]true [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] 89#[L54-1, L31-1]true [2024-02-10 01:00:28,437 INFO L750 eck$LassoCheckResult]: Loop: 89#[L54-1, L31-1]true [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[] 92#[L32, L54-1]true [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] 94#[L33, L54-1]true [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] 96#[L54-1, L34]true [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] 89#[L54-1, L31-1]true [2024-02-10 01:00:28,442 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:00:28,443 INFO L85 PathProgramCache]: Analyzing trace with hash 74974048, now seen corresponding path program 1 times [2024-02-10 01:00:28,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:00:28,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572070114] [2024-02-10 01:00:28,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:00:28,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:00:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:00:28,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:00:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:00:28,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:00:28,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:00:28,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2587876, now seen corresponding path program 1 times [2024-02-10 01:00:28,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:00:28,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970068966] [2024-02-10 01:00:28,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:00:28,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:00:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:00:28,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:00:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:00:28,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:00:28,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:00:28,575 INFO L85 PathProgramCache]: Analyzing trace with hash 941668547, now seen corresponding path program 1 times [2024-02-10 01:00:28,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:00:28,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241617020] [2024-02-10 01:00:28,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:00:28,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:00:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:00:28,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:00:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:00:28,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:00:28,825 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:00:28,826 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:00:28,826 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:00:28,826 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:00:28,827 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:00:28,827 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:28,827 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:00:28,827 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:00:28,827 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum5.bpl_BEv2_Iteration1_Lasso [2024-02-10 01:00:28,827 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:00:28,827 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:00:28,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:28,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:28,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:29,097 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:00:29,100 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:00:29,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:29,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:00:29,104 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:00:29,114 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 [2024-02-10 01:00:29,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:00:29,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:00:29,123 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-10 01:00:29,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:00:29,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-10 01:00:29,147 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-02-10 01:00:29,147 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-10 01:00:29,181 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:00:29,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-10 01:00:29,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:29,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:00:29,193 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:00:29,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-10 01:00:29,215 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 [2024-02-10 01:00:29,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:00:29,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:00:29,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:00:29,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:00:29,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:00:29,239 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:00:29,260 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:00:29,297 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-10 01:00:29,297 INFO L444 ModelExtractionUtils]: 8 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-02-10 01:00:29,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:29,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:00:29,328 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:00:29,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-10 01:00:29,331 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:00:29,340 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:00:29,340 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:00:29,341 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork0_hi, sumThread1of1ForFork0_i) = 1*sumThread1of1ForFork0_hi - 1*sumThread1of1ForFork0_i Supporting invariants [] [2024-02-10 01:00:29,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-10 01:00:29,351 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:00:29,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:00:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:00:29,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:00:29,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:00:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:00:29,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:00:29,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:00:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:00:29,530 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 [2024-02-10 01:00:29,533 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:00:29,733 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 881 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:00:29,735 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:00:29,735 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:00:29,739 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 01:00:29,797 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 01:00:29,798 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:00:29,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:00:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:00:29,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 339 transitions. [2024-02-10 01:00:29,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 339 transitions. Stem has 5 letters. Loop has 4 letters. [2024-02-10 01:00:29,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:00:29,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 339 transitions. Stem has 9 letters. Loop has 4 letters. [2024-02-10 01:00:29,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:00:29,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 339 transitions. Stem has 5 letters. Loop has 8 letters. [2024-02-10 01:00:29,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:00:29,816 INFO L428 stractBuchiCegarLoop]: Abstraction has has 79 places, 751 transitions, 3379 flow [2024-02-10 01:00:29,817 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:00:29,817 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 79 places, 751 transitions, 3379 flow [2024-02-10 01:00:29,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-02-10 01:00:30,209 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:00:30,209 INFO L124 PetriNetUnfolderBase]: 2315/2795 cut-off events. [2024-02-10 01:00:30,209 INFO L125 PetriNetUnfolderBase]: For 293/293 co-relation queries the response was YES. [2024-02-10 01:00:30,209 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:00:30,210 INFO L748 eck$LassoCheckResult]: Stem: 79#[$Ultimate##0]true [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[] 81#[L54]true [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] 83#[L54-1, $Ultimate##0]true [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] 166#[$Ultimate##0, $Ultimate##0, L55]true [77] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork1_x_1 0) InVars {} OutVars{sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_x] 168#[L28, $Ultimate##0, L55]true [78] L28-->L30: Formula: (= v_sumThread1of1ForFork1_z_1 0) InVars {} OutVars{sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_z] 170#[L30, $Ultimate##0, L55]true [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] 172#[L31-1, $Ultimate##0, L55]true [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[] 174#[$Ultimate##0, L32, L55]true [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] 176#[L33, $Ultimate##0, L55]true [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] 178#[L34, $Ultimate##0, L55]true [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_i=v_sumThread1of1ForFork1_i_13, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_3} OutVars{A=v_A_2, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_13, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_z] 172#[L31-1, $Ultimate##0, L55]true [2024-02-10 01:00:30,210 INFO L750 eck$LassoCheckResult]: Loop: 172#[L31-1, $Ultimate##0, L55]true [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[] 174#[$Ultimate##0, L32, L55]true [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] 176#[L33, $Ultimate##0, L55]true [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] 178#[L34, $Ultimate##0, L55]true [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_i=v_sumThread1of1ForFork1_i_13, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_3} OutVars{A=v_A_2, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_13, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_z] 172#[L31-1, $Ultimate##0, L55]true [2024-02-10 01:00:30,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:00:30,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1558366752, now seen corresponding path program 1 times [2024-02-10 01:00:30,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:00:30,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025299202] [2024-02-10 01:00:30,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:00:30,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:00:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:00:30,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:00:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:00:30,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:00:30,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:00:30,264 INFO L85 PathProgramCache]: Analyzing trace with hash 3419044, now seen corresponding path program 1 times [2024-02-10 01:00:30,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:00:30,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233775250] [2024-02-10 01:00:30,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:00:30,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:00:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:00:30,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:00:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:00:30,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:00:30,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:00:30,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1007330813, now seen corresponding path program 2 times [2024-02-10 01:00:30,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:00:30,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796932820] [2024-02-10 01:00:30,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:00:30,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:00:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:00:30,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:00:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:00:30,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:00:30,509 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:00:30,510 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:00:30,510 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:00:30,510 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:00:30,510 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:00:30,510 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:30,510 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:00:30,510 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:00:30,510 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum5.bpl_BEv2_Iteration2_Lasso [2024-02-10 01:00:30,510 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:00:30,510 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:00:30,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:30,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:30,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:30,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:30,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:30,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:30,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:30,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:30,823 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:00:30,823 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:00:30,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:30,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:00:30,825 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:00:30,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-10 01:00:30,829 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 [2024-02-10 01:00:30,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:00:30,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:00:30,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:00:30,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:00:30,840 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:00:30,840 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:00:30,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:00:30,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-10 01:00:30,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:30,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:00:30,893 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:00:30,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-10 01:00:30,930 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 [2024-02-10 01:00:30,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:00:30,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:00:30,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:00:30,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:00:30,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:00:30,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:00:30,952 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:00:30,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-02-10 01:00:30,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:30,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:00:30,959 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:00:30,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-10 01:00:30,961 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 [2024-02-10 01:00:30,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:00:30,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:00:30,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:00:30,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:00:30,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:00:30,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:00:30,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:00:30,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:00:30,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-02-10 01:00:30,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:30,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:00:30,994 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:00:31,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 [2024-02-10 01:00:31,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:00:31,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:00:31,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:00:31,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:00:31,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:00:31,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:00:31,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:00:31,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-02-10 01:00:31,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:00:31,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-10 01:00:31,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:31,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:00:31,061 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:00:31,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-10 01:00:31,066 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 [2024-02-10 01:00:31,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:00:31,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:00:31,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:00:31,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:00:31,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:00:31,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:00:31,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:00:31,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:00:31,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-02-10 01:00:31,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:31,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:00:31,094 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:00:31,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-10 01:00:31,098 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 [2024-02-10 01:00:31,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:00:31,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:00:31,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:00:31,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:00:31,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:00:31,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:00:31,120 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:00:31,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-02-10 01:00:31,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:31,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:00:31,126 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:00:31,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-10 01:00:31,129 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 [2024-02-10 01:00:31,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:00:31,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:00:31,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:00:31,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:00:31,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:00:31,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:00:31,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:00:31,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-02-10 01:00:31,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:31,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:00:31,196 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:00:31,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-10 01:00:31,208 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 [2024-02-10 01:00:31,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:00:31,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:00:31,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:00:31,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:00:31,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:00:31,258 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:00:31,269 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:00:31,280 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-10 01:00:31,280 INFO L444 ModelExtractionUtils]: 9 out of 31 variables were initially zero. Simplification set additionally 19 variables to zero. [2024-02-10 01:00:31,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:31,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:00:31,282 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:00:31,285 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:00:31,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-10 01:00:31,301 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:00:31,302 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:00:31,302 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork1_hi, sumThread1of1ForFork1_i) = 1*sumThread1of1ForFork1_hi - 1*sumThread1of1ForFork1_i Supporting invariants [] [2024-02-10 01:00:31,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-02-10 01:00:31,309 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 01:00:31,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:00:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:00:31,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:00:31,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:00:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:00:31,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:00:31,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:00:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:00:31,371 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 [2024-02-10 01:00:31,371 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:00:31,447 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 881 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:00:31,448 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:00:31,448 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:00:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 881 transitions. [2024-02-10 01:00:31,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions. [2024-02-10 01:00:31,462 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 01:00:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 881 transitions. [2024-02-10 01:00:31,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions. [2024-02-10 01:00:31,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-02-10 01:00:31,827 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 01:00:31,827 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:00:31,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:00:31,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:00:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 339 transitions. [2024-02-10 01:00:31,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 339 transitions. Stem has 10 letters. Loop has 4 letters. [2024-02-10 01:00:31,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:00:31,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 339 transitions. Stem has 14 letters. Loop has 4 letters. [2024-02-10 01:00:31,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:00:31,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 339 transitions. Stem has 10 letters. Loop has 8 letters. [2024-02-10 01:00:31,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:00:31,830 INFO L428 stractBuchiCegarLoop]: Abstraction has has 92 places, 12468 transitions, 80910 flow [2024-02-10 01:00:31,830 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:00:31,830 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 92 places, 12468 transitions, 80910 flow [2024-02-10 01:00:35,990 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:00:35,990 INFO L124 PetriNetUnfolderBase]: 17329/19626 cut-off events. [2024-02-10 01:00:35,990 INFO L125 PetriNetUnfolderBase]: For 1392/1392 co-relation queries the response was YES. [2024-02-10 01:00:35,991 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:00:36,002 INFO L748 eck$LassoCheckResult]: Stem: 79#[$Ultimate##0]true [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[] 81#[L54]true [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] 83#[L54-1, $Ultimate##0]true [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] 166#[$Ultimate##0, $Ultimate##0, L55]true [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] 266#[L56, $Ultimate##0, $Ultimate##0, $Ultimate##0]true [86] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork2_x_1 0) InVars {} OutVars{sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork2_x] 268#[L56, $Ultimate##0, L28, $Ultimate##0]true [87] L28-->L30: Formula: (= v_sumThread1of1ForFork2_z_1 0) InVars {} OutVars{sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork2_z] 270#[L56, L30, $Ultimate##0, $Ultimate##0]true [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] 272#[L56, $Ultimate##0, $Ultimate##0, L31-1]true [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[] 274#[L32, L56, $Ultimate##0, $Ultimate##0]true [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_x=v_sumThread1of1ForFork2_x_3, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_7} OutVars{A=v_A_1, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_4, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_7} AuxVars[] AssignedVars[sumThread1of1ForFork2_x] 276#[L56, L33, $Ultimate##0, $Ultimate##0]true [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] 278#[L56, L34, $Ultimate##0, $Ultimate##0]true [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] 272#[L56, $Ultimate##0, $Ultimate##0, L31-1]true [2024-02-10 01:00:36,010 INFO L750 eck$LassoCheckResult]: Loop: 272#[L56, $Ultimate##0, $Ultimate##0, L31-1]true [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[] 274#[L32, L56, $Ultimate##0, $Ultimate##0]true [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_x=v_sumThread1of1ForFork2_x_3, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_7} OutVars{A=v_A_1, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_4, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_7} AuxVars[] AssignedVars[sumThread1of1ForFork2_x] 276#[L56, L33, $Ultimate##0, $Ultimate##0]true [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] 278#[L56, L34, $Ultimate##0, $Ultimate##0]true [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] 272#[L56, $Ultimate##0, $Ultimate##0, L31-1]true [2024-02-10 01:00:36,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:00:36,011 INFO L85 PathProgramCache]: Analyzing trace with hash 44475972, now seen corresponding path program 1 times [2024-02-10 01:00:36,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:00:36,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322483550] [2024-02-10 01:00:36,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:00:36,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:00:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:00:36,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:00:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:00:36,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:00:36,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:00:36,079 INFO L85 PathProgramCache]: Analyzing trace with hash 3696100, now seen corresponding path program 1 times [2024-02-10 01:00:36,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:00:36,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337546013] [2024-02-10 01:00:36,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:00:36,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:00:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:00:36,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:00:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:00:36,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:00:36,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:00:36,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1724658343, now seen corresponding path program 2 times [2024-02-10 01:00:36,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:00:36,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142710285] [2024-02-10 01:00:36,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:00:36,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:00:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:00:36,134 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:00:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:00:36,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:00:36,472 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:00:36,472 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:00:36,472 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:00:36,473 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:00:36,473 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:00:36,473 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:36,473 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:00:36,473 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:00:36,473 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum5.bpl_BEv2_Iteration3_Lasso [2024-02-10 01:00:36,473 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:00:36,473 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:00:36,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:36,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:36,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:36,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:36,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:36,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:36,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:36,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:36,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:36,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:36,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:36,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:36,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:36,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:00:36,836 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:00:36,836 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:00:36,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:36,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:00:36,844 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:00:36,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-02-10 01:00:36,845 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 [2024-02-10 01:00:36,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:00:36,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:00:36,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:00:36,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:00:36,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:00:36,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:00:36,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:00:36,858 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:00:36,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-02-10 01:00:36,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:36,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:00:36,875 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:00:36,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-02-10 01:00:36,894 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 [2024-02-10 01:00:36,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:00:36,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:00:36,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:00:36,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:00:36,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:00:36,902 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:00:36,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:00:36,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:00:36,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-02-10 01:00:36,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:36,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:00:36,912 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:00:36,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-02-10 01:00:36,915 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 [2024-02-10 01:00:36,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:00:36,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:00:36,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:00:36,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:00:36,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:00:36,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:00:36,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:00:36,925 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:00:36,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-02-10 01:00:36,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:36,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:00:36,960 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:00:36,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-02-10 01:00:36,964 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 [2024-02-10 01:00:36,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:00:36,973 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-02-10 01:00:36,973 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-10 01:00:36,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:00:36,986 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2024-02-10 01:00:36,986 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-10 01:00:37,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:00:37,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-02-10 01:00:37,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:37,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:00:37,040 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:00:37,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-02-10 01:00:37,043 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 [2024-02-10 01:00:37,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:00:37,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:00:37,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:00:37,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:00:37,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:00:37,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:00:37,080 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:00:37,110 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-02-10 01:00:37,111 INFO L444 ModelExtractionUtils]: 11 out of 37 variables were initially zero. Simplification set additionally 21 variables to zero. [2024-02-10 01:00:37,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:00:37,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:00:37,112 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:00:37,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-02-10 01:00:37,124 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:00:37,146 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-02-10 01:00:37,146 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:00:37,146 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork2_i, ULTIMATE.start_k4) = -1*sumThread1of1ForFork2_i + 1*ULTIMATE.start_k4 Supporting invariants [-1*sumThread1of1ForFork2_hi + 1*ULTIMATE.start_k4 >= 0] [2024-02-10 01:00:37,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-02-10 01:00:37,156 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2024-02-10 01:00:37,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:00:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:00:37,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:00:37,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:00:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:00:37,253 WARN L260 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 01:00:37,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:00:37,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:00:37,284 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2024-02-10 01:00:37,284 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:00:37,448 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14 states and 1360 transitions.9 powerset states5 rank states. The highest rank that occured is 1 [2024-02-10 01:00:37,448 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:00:37,448 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:00:37,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states and 1360 transitions. [2024-02-10 01:00:37,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1360 transitions. [2024-02-10 01:00:37,454 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 01:00:37,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states and 1360 transitions. [2024-02-10 01:00:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1360 transitions. [2024-02-10 01:00:37,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-02-10 01:00:51,545 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 01:00:51,545 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:00:51,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2024-02-10 01:00:51,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:00:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 477 transitions. [2024-02-10 01:00:51,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 477 transitions. Stem has 11 letters. Loop has 4 letters. [2024-02-10 01:00:51,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:00:51,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 477 transitions. Stem has 15 letters. Loop has 4 letters. [2024-02-10 01:00:51,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:00:51,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 477 transitions. Stem has 11 letters. Loop has 8 letters. [2024-02-10 01:00:51,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:00:51,568 INFO L428 stractBuchiCegarLoop]: Abstraction has has 112 places, 317759 transitions, 2696083 flow [2024-02-10 01:00:51,568 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 01:00:51,568 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 112 places, 317759 transitions, 2696083 flow Received shutdown request... [2024-02-10 01:04:28,226 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-02-10 01:04:28,296 WARN L341 stractBuchiCegarLoop]: Verification cancelled [2024-02-10 01:04:28,302 INFO L201 PluginConnector]: Adding new model max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:04:28 BoogieIcfgContainer [2024-02-10 01:04:28,302 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:04:28,303 INFO L158 Benchmark]: Toolchain (without parser) took 240717.44ms. Allocated memory was 166.7MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 124.2MB in the beginning and 6.5GB in the end (delta: -6.4GB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. [2024-02-10 01:04:28,303 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.80ms. Allocated memory is still 166.7MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:04:28,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.34ms. Allocated memory is still 166.7MB. Free memory was 124.0MB in the beginning and 141.5MB in the end (delta: -17.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-02-10 01:04:28,304 INFO L158 Benchmark]: Boogie Preprocessor took 42.95ms. Allocated memory is still 166.7MB. Free memory was 141.5MB in the beginning and 140.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:04:28,304 INFO L158 Benchmark]: RCFGBuilder took 376.59ms. Allocated memory is still 166.7MB. Free memory was 140.4MB in the beginning and 130.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-02-10 01:04:28,304 INFO L158 Benchmark]: BuchiAutomizer took 240208.64ms. Allocated memory was 166.7MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 130.2MB in the beginning and 6.5GB in the end (delta: -6.4GB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. [2024-02-10 01:04:28,306 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.80ms. Allocated memory is still 166.7MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 83.34ms. Allocated memory is still 166.7MB. Free memory was 124.0MB in the beginning and 141.5MB in the end (delta: -17.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.95ms. Allocated memory is still 166.7MB. Free memory was 141.5MB in the beginning and 140.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 376.59ms. Allocated memory is still 166.7MB. Free memory was 140.4MB in the beginning and 130.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 240208.64ms. Allocated memory was 166.7MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 130.2MB in the beginning and 6.5GB in the end (delta: -6.4GB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function -1 * i + hi and consists of 5 locations. One deterministic module has affine ranking function -1 * i + hi and consists of 5 locations. One deterministic module has affine ranking function -1 * i + k4 and consists of 8 locations. The remainder module has 2696083 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 240.0s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 3.1s. Construction of modules took 0.1s. Büchi inclusion checks took 15.2s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 728 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 726 mSDsluCounter, 1465 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 799 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 401 IncrementalHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 666 mSDtfsCounter, 401 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital110 mio100 ax100 hnf100 lsp122 ukn61 mio100 lsp52 div100 bol100 ite100 ukn100 eq170 hnf94 smp100 dnf226 smp52 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 60ms VariablesStem: 4 VariablesLoop: 7 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing PetriNetUnfolderBuchi. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown