/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 -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:51:04,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:51:04,181 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-09 23:51:04,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:51:04,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:51:04,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-09 23:51:04,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:51:04,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:51:04,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:51:04,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:51:04,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:51:04,225 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:51:04,225 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:51:04,225 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:51:04,226 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:51:04,226 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:51:04,226 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:51:04,226 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:51:04,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:51:04,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:51:04,227 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:51:04,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:51:04,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:51:04,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:51:04,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:51:04,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:51:04,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:51:04,242 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:51:04,242 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:51:04,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:51:04,242 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:51:04,242 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:51:04,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:51:04,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:51:04,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:51:04,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:51:04,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:51:04,257 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:51:04,257 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 [2024-02-09 23:51:04,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:51:04,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:51:04,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:51:04,553 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-09 23:51:04,554 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-09 23:51:04,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum4.bpl [2024-02-09 23:51:04,555 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum4.bpl' [2024-02-09 23:51:04,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:51:04,588 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-09 23:51:04,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:51:04,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:51:04,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:51:04,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:51:04" (1/1) ... [2024-02-09 23:51:04,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:51:04" (1/1) ... [2024-02-09 23:51:04,620 INFO L138 Inliner]: procedures = 3, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-09 23:51:04,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:51:04,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:51:04,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:51:04,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:51:04,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:51:04" (1/1) ... [2024-02-09 23:51:04,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:51:04" (1/1) ... [2024-02-09 23:51:04,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:51:04" (1/1) ... [2024-02-09 23:51:04,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:51:04" (1/1) ... [2024-02-09 23:51:04,671 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:51:04" (1/1) ... [2024-02-09 23:51:04,674 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:51:04" (1/1) ... [2024-02-09 23:51:04,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:51:04" (1/1) ... [2024-02-09 23:51:04,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:51:04" (1/1) ... [2024-02-09 23:51:04,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:51:04,687 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:51:04,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:51:04,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:51:04,690 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:51:04" (1/1) ... [2024-02-09 23:51:04,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:04,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:04,774 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-09 23:51:04,824 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-09 23:51:04,856 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-09 23:51:04,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:51:04,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:51:04,857 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2024-02-09 23:51:04,857 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-02-09 23:51:04,857 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-02-09 23:51:04,858 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-09 23:51:04,916 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:51:04,918 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:51:05,048 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:51:05,054 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:51:05,054 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-09 23:51:05,056 INFO L201 PluginConnector]: Adding new model max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:51:05 BoogieIcfgContainer [2024-02-09 23:51:05,056 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:51:05,057 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:51:05,057 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:51:05,061 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:51:05,062 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:51:05,062 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:51:04" (1/2) ... [2024-02-09 23:51:05,063 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29e9ed6 and model type max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:51:05, skipping insertion in model container [2024-02-09 23:51:05,063 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:51:05,063 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:51:05" (2/2) ... [2024-02-09 23:51:05,065 INFO L332 chiAutomizerObserver]: Analyzing ICFG max-tailsum4.bpl [2024-02-09 23:51:05,139 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-09 23:51:05,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 56 transitions, 140 flow [2024-02-09 23:51:05,184 INFO L124 PetriNetUnfolderBase]: 4/48 cut-off events. [2024-02-09 23:51:05,184 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-09 23:51:05,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 48 events. 4/48 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-02-09 23:51:05,188 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 56 transitions, 140 flow [2024-02-09 23:51:05,192 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 48 transitions, 120 flow [2024-02-09 23:51:05,197 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:51:05,197 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:51:05,197 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:51:05,197 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:51:05,197 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:51:05,197 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:51:05,197 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:51:05,197 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-09 23:51:05,198 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 57 places, 48 transitions, 120 flow [2024-02-09 23:51:05,206 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:51:05,206 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-02-09 23:51:05,206 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-09 23:51:05,206 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:51:05,210 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:51:05,211 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 57 places, 48 transitions, 120 flow [2024-02-09 23:51:05,216 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:51:05,216 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-02-09 23:51:05,216 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-09 23:51:05,216 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:51:05,221 INFO L748 eck$LassoCheckResult]: Stem: 65#[$Ultimate##0]true [43] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_N_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[] 67#[L54]true [84] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo] 69#[L54-1, $Ultimate##0]true [46] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork0_x_1 0) InVars {} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_x] 71#[L28, L54-1]true [47] L28-->L30: Formula: (= v_sumThread1of1ForFork0_z_1 0) InVars {} OutVars{sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_z] 73#[L54-1, L30]true [48] L30-->L31-1: Formula: (= v_sumThread1of1ForFork0_i_1 v_sumThread1of1ForFork0_lo_1) InVars {sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_1} OutVars{sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_1, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_i] 75#[L54-1, L31-1]true [2024-02-09 23:51:05,221 INFO L750 eck$LassoCheckResult]: Loop: 75#[L54-1, L31-1]true [50] L31-1-->L32: Formula: (< v_sumThread1of1ForFork0_i_5 v_sumThread1of1ForFork0_hi_3) InVars {sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_5} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_5} AuxVars[] AssignedVars[] 78#[L32, L54-1]true [52] L32-->L33: Formula: (= (+ v_sumThread1of1ForFork0_x_3 (select v_A_1 v_sumThread1of1ForFork0_i_7)) v_sumThread1of1ForFork0_x_4) InVars {A=v_A_1, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_7} OutVars{A=v_A_1, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_4, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_7} AuxVars[] AssignedVars[sumThread1of1ForFork0_x] 80#[L33, L54-1]true [53] L33-->L34: Formula: (= (+ v_sumThread1of1ForFork0_i_9 1) v_sumThread1of1ForFork0_i_10) InVars {sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_9} OutVars{sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_10} AuxVars[] AssignedVars[sumThread1of1ForFork0_i] 82#[L54-1, L34]true [54] L34-->L31-1: Formula: (= (let ((.cse0 (+ (select v_A_2 v_sumThread1of1ForFork0_i_13) v_sumThread1of1ForFork0_z_3))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork0_z_4) InVars {A=v_A_2, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_13} OutVars{A=v_A_2, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_4, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_13} AuxVars[] AssignedVars[sumThread1of1ForFork0_z] 75#[L54-1, L31-1]true [2024-02-09 23:51:05,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:51:05,225 INFO L85 PathProgramCache]: Analyzing trace with hash 70888709, now seen corresponding path program 1 times [2024-02-09 23:51:05,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:51:05,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769393332] [2024-02-09 23:51:05,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:51:05,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:51:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:05,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:51:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:05,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:51:05,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:51:05,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2464740, now seen corresponding path program 1 times [2024-02-09 23:51:05,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:51:05,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864546663] [2024-02-09 23:51:05,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:51:05,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:51:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:05,329 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:51:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:05,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:51:05,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:51:05,338 INFO L85 PathProgramCache]: Analyzing trace with hash -973527320, now seen corresponding path program 1 times [2024-02-09 23:51:05,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:51:05,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028848318] [2024-02-09 23:51:05,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:51:05,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:51:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:05,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:51:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:05,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:51:05,550 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:51:05,550 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:51:05,550 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:51:05,551 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:51:05,551 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:51:05,551 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:05,551 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:51:05,551 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:51:05,551 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum4.bpl_BEv2_Iteration1_Lasso [2024-02-09 23:51:05,551 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:51:05,551 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:51:05,565 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-09 23:51:05,662 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-09 23:51:05,665 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-09 23:51:05,794 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:51:05,797 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:51:05,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:05,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:05,801 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-09 23:51:05,805 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-09 23:51:05,806 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-09 23:51:05,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:51:05,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:51:05,814 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-09 23:51:05,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:51:05,829 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-02-09 23:51:05,830 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-09 23:51:05,857 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:51:05,876 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-09 23:51:05,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:05,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:05,878 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-09 23:51:05,882 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-09 23:51:05,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:51:05,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:51:05,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:51:05,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:51:05,892 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-09 23:51:05,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:51:05,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:51:05,918 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:51:05,938 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-02-09 23:51:05,939 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-02-09 23:51:05,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:05,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:05,943 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-09 23:51:05,968 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-09 23:51:05,969 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:51:05,988 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:51:05,988 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:51:05,989 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork0_hi, sumThread1of1ForFork0_i) = 1*sumThread1of1ForFork0_hi - 1*sumThread1of1ForFork0_i Supporting invariants [] [2024-02-09 23:51:05,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-02-09 23:51:05,995 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:51:06,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:51:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:51:06,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:51:06,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:51:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:51:06,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:51:06,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:51:06,108 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-09 23:51:06,142 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-09 23:51:06,147 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-09 23:51:06,300 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 712 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-09 23:51:06,301 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:51:06,301 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:51:06,313 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:51:06,314 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:51:06,316 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-09 23:51:06,319 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-09 23:51:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 274 transitions. [2024-02-09 23:51:06,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 274 transitions. Stem has 5 letters. Loop has 4 letters. [2024-02-09 23:51:06,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:51:06,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 274 transitions. Stem has 9 letters. Loop has 4 letters. [2024-02-09 23:51:06,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:51:06,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 274 transitions. Stem has 5 letters. Loop has 8 letters. [2024-02-09 23:51:06,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:51:06,329 INFO L428 stractBuchiCegarLoop]: Abstraction has has 75 places, 1216 transitions, 5458 flow [2024-02-09 23:51:06,329 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:51:06,329 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 75 places, 1216 transitions, 5458 flow [2024-02-09 23:51:06,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-09 23:51:06,558 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:51:06,558 INFO L124 PetriNetUnfolderBase]: 1842/2380 cut-off events. [2024-02-09 23:51:06,558 INFO L125 PetriNetUnfolderBase]: For 221/221 co-relation queries the response was YES. [2024-02-09 23:51:06,559 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:51:06,559 INFO L748 eck$LassoCheckResult]: Stem: 65#[$Ultimate##0]true [43] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_N_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[] 67#[L54]true [84] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo] 69#[L54-1, $Ultimate##0]true [87] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= v_ULTIMATE.start_k2_3 v_sumThread1of1ForFork1_hi_6) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_16, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_8, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_hi, sumThread1of1ForFork1_z, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_thidvar1, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x, sumThread1of1ForFork1_lo] 161#[$Ultimate##0, $Ultimate##0, L55]true [64] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork1_x_1 0) InVars {} OutVars{sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_x] 163#[L28, $Ultimate##0, L55]true [65] L28-->L30: Formula: (= v_sumThread1of1ForFork1_z_1 0) InVars {} OutVars{sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_z] 165#[L30, $Ultimate##0, L55]true [66] L30-->L31-1: Formula: (= v_sumThread1of1ForFork1_i_1 v_sumThread1of1ForFork1_lo_1) InVars {sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_1} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_1, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_i] 167#[L31-1, $Ultimate##0, L55]true [68] L31-1-->L32: Formula: (< v_sumThread1of1ForFork1_i_5 v_sumThread1of1ForFork1_hi_3) InVars {sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_5, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_3} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_5, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_3} AuxVars[] AssignedVars[] 169#[$Ultimate##0, L32, L55]true [70] L32-->L33: Formula: (= (+ (select v_A_1 v_sumThread1of1ForFork1_i_7) v_sumThread1of1ForFork1_x_3) v_sumThread1of1ForFork1_x_4) InVars {A=v_A_1, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_7, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_3} OutVars{A=v_A_1, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_7, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_x] 171#[L33, $Ultimate##0, L55]true [71] L33-->L34: Formula: (= (+ v_sumThread1of1ForFork1_i_9 1) v_sumThread1of1ForFork1_i_10) InVars {sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_9} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_10} AuxVars[] AssignedVars[sumThread1of1ForFork1_i] 173#[L34, $Ultimate##0, L55]true [72] L34-->L31-1: Formula: (= v_sumThread1of1ForFork1_z_4 (let ((.cse0 (+ (select v_A_2 v_sumThread1of1ForFork1_i_13) v_sumThread1of1ForFork1_z_3))) (ite (< 0 .cse0) .cse0 0))) InVars {A=v_A_2, sumThread1of1ForFork1_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] 167#[L31-1, $Ultimate##0, L55]true [2024-02-09 23:51:06,560 INFO L750 eck$LassoCheckResult]: Loop: 167#[L31-1, $Ultimate##0, L55]true [68] L31-1-->L32: Formula: (< v_sumThread1of1ForFork1_i_5 v_sumThread1of1ForFork1_hi_3) InVars {sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_5, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_3} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_5, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_3} AuxVars[] AssignedVars[] 169#[$Ultimate##0, L32, L55]true [70] L32-->L33: Formula: (= (+ (select v_A_1 v_sumThread1of1ForFork1_i_7) v_sumThread1of1ForFork1_x_3) v_sumThread1of1ForFork1_x_4) InVars {A=v_A_1, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_7, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_3} OutVars{A=v_A_1, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_7, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_x] 171#[L33, $Ultimate##0, L55]true [71] L33-->L34: Formula: (= (+ v_sumThread1of1ForFork1_i_9 1) v_sumThread1of1ForFork1_i_10) InVars {sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_9} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_10} AuxVars[] AssignedVars[sumThread1of1ForFork1_i] 173#[L34, $Ultimate##0, L55]true [72] L34-->L31-1: Formula: (= v_sumThread1of1ForFork1_z_4 (let ((.cse0 (+ (select v_A_2 v_sumThread1of1ForFork1_i_13) v_sumThread1of1ForFork1_z_3))) (ite (< 0 .cse0) .cse0 0))) InVars {A=v_A_2, sumThread1of1ForFork1_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] 167#[L31-1, $Ultimate##0, L55]true [2024-02-09 23:51:06,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:51:06,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1030830039, now seen corresponding path program 1 times [2024-02-09 23:51:06,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:51:06,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108440511] [2024-02-09 23:51:06,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:51:06,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:51:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:06,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:51:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:06,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:51:06,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:51:06,584 INFO L85 PathProgramCache]: Analyzing trace with hash 3018852, now seen corresponding path program 1 times [2024-02-09 23:51:06,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:51:06,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598654283] [2024-02-09 23:51:06,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:51:06,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:51:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:06,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:51:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:06,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:51:06,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:51:06,594 INFO L85 PathProgramCache]: Analyzing trace with hash 804482362, now seen corresponding path program 2 times [2024-02-09 23:51:06,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:51:06,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569908265] [2024-02-09 23:51:06,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:51:06,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:51:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:06,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:51:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:06,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:51:06,853 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:51:06,853 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:51:06,853 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:51:06,853 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:51:06,853 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:51:06,853 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:06,853 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:51:06,854 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:51:06,854 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum4.bpl_BEv2_Iteration2_Lasso [2024-02-09 23:51:06,854 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:51:06,854 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:51:06,858 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-09 23:51:06,861 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-09 23:51:06,863 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-09 23:51:06,865 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-09 23:51:06,867 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-09 23:51:06,869 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-09 23:51:06,872 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-09 23:51:06,874 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-09 23:51:07,173 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:51:07,173 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:51:07,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:07,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:07,174 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-09 23:51:07,196 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-09 23:51:07,197 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-09 23:51:07,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:51:07,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:51:07,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:51:07,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:51:07,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:51:07,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:51:07,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:51:07,249 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-09 23:51:07,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:07,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:07,265 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-09 23:51:07,280 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-09 23:51:07,281 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-09 23:51:07,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:51:07,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:51:07,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:51:07,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:51:07,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:51:07,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:51:07,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:51:07,309 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-09 23:51:07,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:07,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:07,325 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-09 23:51:07,348 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-09 23:51:07,351 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-09 23:51:07,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:51:07,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:51:07,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:51:07,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:51:07,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:51:07,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:51:07,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:51:07,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:51:07,375 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-09 23:51:07,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:07,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:07,379 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-09 23:51:07,381 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-09 23:51:07,381 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-09 23:51:07,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:51:07,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:51:07,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:51:07,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:51:07,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:51:07,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:51:07,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:51:07,405 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:51:07,409 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-09 23:51:07,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:07,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:07,411 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-09 23:51:07,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:51:07,460 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-09 23:51:07,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:51:07,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:51:07,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:51:07,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:51:07,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:51:07,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:51:07,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:51:07,476 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:51:07,480 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-09 23:51:07,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:07,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:07,482 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-09 23:51:07,486 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-09 23:51:07,487 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-09 23:51:07,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:51:07,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:51:07,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:51:07,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:51:07,496 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:51:07,496 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:51:07,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:51:07,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-02-09 23:51:07,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:07,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:07,539 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-09 23:51:07,548 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-09 23:51:07,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:51:07,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:51:07,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:51:07,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:51:07,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:51:07,558 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:51:07,561 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-09 23:51:07,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:51:07,574 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-09 23:51:07,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:07,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:07,576 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-09 23:51:07,580 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-09 23:51:07,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:51:07,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:51:07,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:51:07,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:51:07,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:51:07,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:51:07,601 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-09 23:51:07,606 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:51:07,613 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-02-09 23:51:07,613 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-02-09 23:51:07,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:07,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:07,614 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-09 23:51:07,619 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:51:07,627 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-09 23:51:07,637 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:51:07,637 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:51:07,637 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork1_hi, sumThread1of1ForFork1_i) = 1*sumThread1of1ForFork1_hi - 1*sumThread1of1ForFork1_i Supporting invariants [] [2024-02-09 23:51:07,641 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-09 23:51:07,643 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:51:07,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:51:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:51:07,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:51:07,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:51:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:51:07,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:51:07,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:51:07,700 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-09 23:51:07,701 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-09 23:51:07,701 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-09 23:51:07,759 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 712 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-09 23:51:07,759 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:51:07,759 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:51:07,857 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:51:07,857 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:51:07,858 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-09 23:51:07,859 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-09 23:51:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 274 transitions. [2024-02-09 23:51:07,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 274 transitions. Stem has 10 letters. Loop has 4 letters. [2024-02-09 23:51:07,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:51:07,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 274 transitions. Stem has 14 letters. Loop has 4 letters. [2024-02-09 23:51:07,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:51:07,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 274 transitions. Stem has 10 letters. Loop has 8 letters. [2024-02-09 23:51:07,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:51:07,860 INFO L428 stractBuchiCegarLoop]: Abstraction has has 93 places, 30784 transitions, 199368 flow [2024-02-09 23:51:07,860 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-09 23:51:07,860 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 93 places, 30784 transitions, 199368 flow [2024-02-09 23:51:08,218 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-09 23:51:12,012 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:51:12,012 INFO L124 PetriNetUnfolderBase]: 13598/16147 cut-off events. [2024-02-09 23:51:12,012 INFO L125 PetriNetUnfolderBase]: For 1061/1061 co-relation queries the response was YES. [2024-02-09 23:51:12,012 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:51:12,013 INFO L748 eck$LassoCheckResult]: Stem: 65#[$Ultimate##0]true [43] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_N_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[] 67#[L54]true [84] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo] 69#[L54-1, $Ultimate##0]true [87] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= v_ULTIMATE.start_k2_3 v_sumThread1of1ForFork1_hi_6) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_16, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_8, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_hi, sumThread1of1ForFork1_z, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_thidvar1, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x, sumThread1of1ForFork1_lo] 161#[$Ultimate##0, $Ultimate##0, L55]true [90] L55-->$Ultimate##0: Formula: (and (= 3 v_sumThread1of1ForFork2_thidvar1_2) (= 3 v_sumThread1of1ForFork2_thidvar0_2) (= 3 v_sumThread1of1ForFork2_thidvar2_2) (= v_ULTIMATE.start_k3_3 v_sumThread1of1ForFork2_hi_6) (= v_sumThread1of1ForFork2_lo_4 (+ v_ULTIMATE.start_k2_5 1))) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_3, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5} OutVars{sumThread1of1ForFork2_thidvar0=v_sumThread1of1ForFork2_thidvar0_2, sumThread1of1ForFork2_thidvar1=v_sumThread1of1ForFork2_thidvar1_2, sumThread1of1ForFork2_thidvar2=v_sumThread1of1ForFork2_thidvar2_2, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_8, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_16, ULTIMATE.start_k3=v_ULTIMATE.start_k3_3, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_8, sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_4, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_6} AuxVars[] AssignedVars[sumThread1of1ForFork2_thidvar0, sumThread1of1ForFork2_thidvar1, sumThread1of1ForFork2_thidvar2, sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x, sumThread1of1ForFork2_lo, sumThread1of1ForFork2_hi] 266#[L56, $Ultimate##0, $Ultimate##0, $Ultimate##0]true [73] $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 [74] 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 [75] L30-->L31-1: Formula: (= v_sumThread1of1ForFork2_i_1 v_sumThread1of1ForFork2_lo_1) InVars {sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_1} OutVars{sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_1, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_1} AuxVars[] AssignedVars[sumThread1of1ForFork2_i] 272#[L56, $Ultimate##0, L31-1, $Ultimate##0]true [77] L31-1-->L32: Formula: (< v_sumThread1of1ForFork2_i_5 v_sumThread1of1ForFork2_hi_3) InVars {sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_3, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_5} OutVars{sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_3, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_5} AuxVars[] AssignedVars[] 274#[L32, L56, $Ultimate##0, $Ultimate##0]true [79] L32-->L33: Formula: (= v_sumThread1of1ForFork2_x_4 (+ (select v_A_1 v_sumThread1of1ForFork2_i_7) v_sumThread1of1ForFork2_x_3)) InVars {A=v_A_1, sumThread1of1ForFork2_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 [80] L33-->L34: Formula: (= (+ v_sumThread1of1ForFork2_i_9 1) v_sumThread1of1ForFork2_i_10) InVars {sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_9} OutVars{sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_10} AuxVars[] AssignedVars[sumThread1of1ForFork2_i] 278#[L56, L34, $Ultimate##0, $Ultimate##0]true [81] L34-->L31-1: Formula: (= v_sumThread1of1ForFork2_z_4 (let ((.cse0 (+ (select v_A_2 v_sumThread1of1ForFork2_i_13) v_sumThread1of1ForFork2_z_3))) (ite (< 0 .cse0) .cse0 0))) InVars {A=v_A_2, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_3, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_13} OutVars{A=v_A_2, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_4, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_13} AuxVars[] AssignedVars[sumThread1of1ForFork2_z] 272#[L56, $Ultimate##0, L31-1, $Ultimate##0]true [2024-02-09 23:51:12,013 INFO L750 eck$LassoCheckResult]: Loop: 272#[L56, $Ultimate##0, L31-1, $Ultimate##0]true [77] L31-1-->L32: Formula: (< v_sumThread1of1ForFork2_i_5 v_sumThread1of1ForFork2_hi_3) InVars {sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_3, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_5} OutVars{sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_3, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_5} AuxVars[] AssignedVars[] 274#[L32, L56, $Ultimate##0, $Ultimate##0]true [79] L32-->L33: Formula: (= v_sumThread1of1ForFork2_x_4 (+ (select v_A_1 v_sumThread1of1ForFork2_i_7) v_sumThread1of1ForFork2_x_3)) InVars {A=v_A_1, sumThread1of1ForFork2_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 [80] L33-->L34: Formula: (= (+ v_sumThread1of1ForFork2_i_9 1) v_sumThread1of1ForFork2_i_10) InVars {sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_9} OutVars{sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_10} AuxVars[] AssignedVars[sumThread1of1ForFork2_i] 278#[L56, L34, $Ultimate##0, $Ultimate##0]true [81] L34-->L31-1: Formula: (= v_sumThread1of1ForFork2_z_4 (let ((.cse0 (+ (select v_A_2 v_sumThread1of1ForFork2_i_13) v_sumThread1of1ForFork2_z_3))) (ite (< 0 .cse0) .cse0 0))) InVars {A=v_A_2, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_3, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_13} OutVars{A=v_A_2, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_4, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_13} AuxVars[] AssignedVars[sumThread1of1ForFork2_z] 272#[L56, $Ultimate##0, L31-1, $Ultimate##0]true [2024-02-09 23:51:12,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:51:12,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1294802144, now seen corresponding path program 1 times [2024-02-09 23:51:12,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:51:12,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943084444] [2024-02-09 23:51:12,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:51:12,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:51:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:12,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:51:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:12,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:51:12,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:51:12,050 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 1 times [2024-02-09 23:51:12,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:51:12,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259190252] [2024-02-09 23:51:12,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:51:12,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:51:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:12,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:51:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:12,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:51:12,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:51:12,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2056291907, now seen corresponding path program 2 times [2024-02-09 23:51:12,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:51:12,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224694385] [2024-02-09 23:51:12,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:51:12,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:51:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:12,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:51:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:12,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:51:12,351 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:51:12,351 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:51:12,351 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:51:12,351 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:51:12,351 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:51:12,351 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:12,351 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:51:12,351 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:51:12,351 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum4.bpl_BEv2_Iteration3_Lasso [2024-02-09 23:51:12,351 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:51:12,351 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:51:12,354 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-09 23:51:12,356 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-09 23:51:12,357 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-09 23:51:12,358 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-09 23:51:12,447 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-09 23:51:12,450 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-09 23:51:12,452 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-09 23:51:12,454 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-09 23:51:12,456 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-09 23:51:12,458 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-09 23:51:12,460 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-09 23:51:12,462 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-09 23:51:12,465 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-09 23:51:12,468 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-09 23:51:12,692 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:51:12,692 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:51:12,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:12,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:12,693 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-09 23:51:12,698 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-09 23:51:12,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:51:12,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:51:12,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:51:12,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:51:12,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:51:12,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:51:12,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:51:12,708 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-09 23:51:12,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:51:12,727 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-09 23:51:12,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:12,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:12,728 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-09 23:51:12,751 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-09 23:51:12,753 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-09 23:51:12,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:51:12,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:51:12,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:51:12,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:51:12,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:51:12,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:51:12,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:51:12,773 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:51:12,777 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-09 23:51:12,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:12,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:12,778 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-09 23:51:12,780 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-09 23:51:12,781 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-09 23:51:12,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:51:12,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:51:12,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:51:12,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:51:12,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:51:12,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:51:12,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:51:12,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:51:12,803 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-09 23:51:12,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:12,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:12,804 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-09 23:51:12,807 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-09 23:51:12,807 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-09 23:51:12,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:51:12,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:51:12,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:51:12,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:51:12,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:51:12,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:51:12,856 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:51:12,865 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-09 23:51:12,865 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-02-09 23:51:12,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:12,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:12,866 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-09 23:51:12,920 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-09 23:51:12,921 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:51:12,930 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:51:12,930 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:51:12,930 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork2_i, sumThread1of1ForFork2_hi) = -1*sumThread1of1ForFork2_i + 1*sumThread1of1ForFork2_hi Supporting invariants [] [2024-02-09 23:51:12,934 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-09 23:51:12,936 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:51:12,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:51:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:51:12,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:51:12,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:51:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:51:12,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:51:12,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:51:13,024 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-09 23:51:13,025 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-09 23:51:13,025 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-09 23:51:13,094 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 9 states and 712 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-09 23:51:13,094 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:51:13,094 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:51:19,728 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:51:19,728 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:51:19,728 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-09 23:51:19,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-09 23:51:19,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 274 transitions. [2024-02-09 23:51:19,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 274 transitions. Stem has 11 letters. Loop has 4 letters. [2024-02-09 23:51:19,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:51:19,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 274 transitions. Stem has 15 letters. Loop has 4 letters. [2024-02-09 23:51:19,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:51:19,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 274 transitions. Stem has 11 letters. Loop has 8 letters. [2024-02-09 23:51:19,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:51:19,737 INFO L428 stractBuchiCegarLoop]: Abstraction has has 111 places, 778752 transitions, 6591000 flow [2024-02-09 23:51:19,737 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-09 23:51:19,738 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 111 places, 778752 transitions, 6591000 flow [2024-02-09 23:51:39,310 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 Received shutdown request... [2024-02-09 23:54:57,745 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-09 23:54:57,780 WARN L341 stractBuchiCegarLoop]: Verification cancelled [2024-02-09 23:54:57,785 INFO L201 PluginConnector]: Adding new model max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:54:57 BoogieIcfgContainer [2024-02-09 23:54:57,785 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:54:57,785 INFO L158 Benchmark]: Toolchain (without parser) took 233197.15ms. Allocated memory was 194.0MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 155.6MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 5.8GB. Max. memory is 8.0GB. [2024-02-09 23:54:57,786 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 194.0MB. Free memory is still 156.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:54:57,786 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.59ms. Allocated memory is still 194.0MB. Free memory was 155.5MB in the beginning and 154.1MB in the end (delta: 1.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-02-09 23:54:57,786 INFO L158 Benchmark]: Boogie Preprocessor took 64.08ms. Allocated memory is still 194.0MB. Free memory was 154.0MB in the beginning and 170.7MB in the end (delta: -16.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-09 23:54:57,786 INFO L158 Benchmark]: RCFGBuilder took 368.99ms. Allocated memory is still 194.0MB. Free memory was 170.5MB in the beginning and 161.0MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-09 23:54:57,787 INFO L158 Benchmark]: BuchiAutomizer took 232728.35ms. Allocated memory was 194.0MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 160.8MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 5.8GB. Max. memory is 8.0GB. [2024-02-09 23:54:57,788 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.19ms. Allocated memory is still 194.0MB. Free memory is still 156.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.59ms. Allocated memory is still 194.0MB. Free memory was 155.5MB in the beginning and 154.1MB in the end (delta: 1.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.08ms. Allocated memory is still 194.0MB. Free memory was 154.0MB in the beginning and 170.7MB in the end (delta: -16.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 368.99ms. Allocated memory is still 194.0MB. Free memory was 170.5MB in the beginning and 161.0MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 232728.35ms. Allocated memory was 194.0MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 160.8MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 5.8GB. 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 + hi and consists of 5 locations. The remainder module has 6591000 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 232.6s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 2.7s. Construction of modules took 0.1s. Büchi inclusion checks took 7.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, 479 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 476 mSDsluCounter, 780 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 378 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 226 IncrementalHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 402 mSDtfsCounter, 226 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital107 mio100 ax100 hnf100 lsp123 ukn60 mio100 lsp53 div100 bol100 ite100 ukn100 eq171 hnf94 smp100 dnf229 smp52 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 59ms VariablesStem: 2 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - 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