/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations false --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:35:05,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:35:05,530 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 01:35:05,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:35:05,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:35:05,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:35:05,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:35:05,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:35:05,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:35:05,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:35:05,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:35:05,553 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:35:05,553 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:35:05,553 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:35:05,553 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:35:05,554 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:35:05,554 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:35:05,554 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:35:05,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:35:05,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:35:05,555 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:35:05,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:35:05,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:35:05,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:35:05,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:35:05,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:35:05,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:35:05,566 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:35:05,566 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:35:05,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:35:05,566 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:35:05,567 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:35:05,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:35:05,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:35:05,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:35:05,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:35:05,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:35:05,568 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:35:05,568 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 01:35:05,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:35:05,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:35:05,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:35:05,933 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:35:05,934 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:35:05,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum5.bpl [2024-02-10 01:35:05,935 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum5.bpl' [2024-02-10 01:35:05,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:35:05,973 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:35:05,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:35:05,977 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:35:05,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:35:05,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:05" (1/1) ... [2024-02-10 01:35:06,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:05" (1/1) ... [2024-02-10 01:35:06,015 INFO L138 Inliner]: procedures = 3, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 01:35:06,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:35:06,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:35:06,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:35:06,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:35:06,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:05" (1/1) ... [2024-02-10 01:35:06,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:05" (1/1) ... [2024-02-10 01:35:06,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:05" (1/1) ... [2024-02-10 01:35:06,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:05" (1/1) ... [2024-02-10 01:35:06,105 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:05" (1/1) ... [2024-02-10 01:35:06,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:05" (1/1) ... [2024-02-10 01:35:06,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:05" (1/1) ... [2024-02-10 01:35:06,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:05" (1/1) ... [2024-02-10 01:35:06,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:35:06,123 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:35:06,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:35:06,124 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:35:06,125 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:05" (1/1) ... [2024-02-10 01:35:06,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:35:06,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:35:06,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:35:06,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-10 01:35:06,261 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:35:06,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:35:06,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:35:06,262 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2024-02-10 01:35:06,262 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-02-10 01:35:06,263 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-02-10 01:35:06,263 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 01:35:06,322 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:35:06,324 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:35:06,429 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:35:06,440 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:35:06,440 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 01:35:06,443 INFO L201 PluginConnector]: Adding new model max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:35:06 BoogieIcfgContainer [2024-02-10 01:35:06,444 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:35:06,444 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:35:06,444 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:35:06,448 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:35:06,449 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:35:06,449 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:35:05" (1/2) ... [2024-02-10 01:35:06,450 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f7c51d1 and model type max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:35:06, skipping insertion in model container [2024-02-10 01:35:06,451 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:35:06,451 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:35:06" (2/2) ... [2024-02-10 01:35:06,452 INFO L332 chiAutomizerObserver]: Analyzing ICFG max-tailsum5.bpl [2024-02-10 01:35:06,543 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-02-10 01:35:06,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 69 transitions, 173 flow [2024-02-10 01:35:06,601 INFO L124 PetriNetUnfolderBase]: 5/59 cut-off events. [2024-02-10 01:35:06,602 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-02-10 01:35:06,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 59 events. 5/59 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 178 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2024-02-10 01:35:06,611 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 69 transitions, 173 flow [2024-02-10 01:35:06,621 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 59 transitions, 148 flow [2024-02-10 01:35:06,628 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:35:06,628 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:35:06,628 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:35:06,628 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:35:06,629 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:35:06,629 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:35:06,629 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:35:06,629 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:35:06,629 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:35:06,630 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 70 places, 59 transitions, 148 flow [2024-02-10 01:35:09,864 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 73815 states, 73813 states have (on average 4.974936664273231) internal successors, (367215), 73814 states have internal predecessors, (367215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:35:10,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 73815 states, 73813 states have (on average 4.974936664273231) internal successors, (367215), 73814 states have internal predecessors, (367215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:35:12,902 INFO L131 ngComponentsAnalysis]: Automaton has 6199 accepting balls. 69124 [2024-02-10 01:35:12,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:35:12,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:35:12,909 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:35:12,909 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:35:12,909 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 70 places, 59 transitions, 148 flow [2024-02-10 01:35:15,165 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 73815 states, 73813 states have (on average 4.974936664273231) internal successors, (367215), 73814 states have internal predecessors, (367215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:35:15,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 73815 states, 73813 states have (on average 4.974936664273231) internal successors, (367215), 73814 states have internal predecessors, (367215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:35:17,707 INFO L131 ngComponentsAnalysis]: Automaton has 6199 accepting balls. 69124 [2024-02-10 01:35:17,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:35:17,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:35:17,715 INFO L748 eck$LassoCheckResult]: Stem: Black: 147710#[$Ultimate##0]don't care [47] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_ULTIMATE.start_k4_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= v_ULTIMATE.start_k4_1 v_N_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1, ULTIMATE.start_k4=v_ULTIMATE.start_k4_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1, ULTIMATE.start_k4=v_ULTIMATE.start_k4_1} AuxVars[] AssignedVars[] 147713#[L54]don't care [97] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo] 147715#[$Ultimate##0, L54-1]don't care [50] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork0_x_1 0) InVars {} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_x] 147717#[L28, L54-1]don't care [51] L28-->L30: Formula: (= v_sumThread1of1ForFork0_z_1 0) InVars {} OutVars{sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_z] 147723#[L30, L54-1]don't care [52] L30-->L31-1: Formula: (= v_sumThread1of1ForFork0_i_1 v_sumThread1of1ForFork0_lo_1) InVars {sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_1} OutVars{sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_1, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_i] 147735#[L31-1, L54-1]don't care [2024-02-10 01:35:17,715 INFO L750 eck$LassoCheckResult]: Loop: 147735#[L31-1, L54-1]don't care [54] L31-1-->L32: Formula: (< v_sumThread1of1ForFork0_i_5 v_sumThread1of1ForFork0_hi_3) InVars {sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_5} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_5} AuxVars[] AssignedVars[] 147761#[L32, L54-1]don't care [56] L32-->L33: Formula: (= (+ v_sumThread1of1ForFork0_x_3 (select v_A_1 v_sumThread1of1ForFork0_i_7)) v_sumThread1of1ForFork0_x_4) InVars {A=v_A_1, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_7} OutVars{A=v_A_1, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_4, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_7} AuxVars[] AssignedVars[sumThread1of1ForFork0_x] 147813#[L33, L54-1]don't care [57] L33-->L34: Formula: (= (+ v_sumThread1of1ForFork0_i_9 1) v_sumThread1of1ForFork0_i_10) InVars {sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_9} OutVars{sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_10} AuxVars[] AssignedVars[sumThread1of1ForFork0_i] 147915#[L34, L54-1]don't care [58] L34-->L31-1: Formula: (= (let ((.cse0 (+ (select v_A_2 v_sumThread1of1ForFork0_i_13) v_sumThread1of1ForFork0_z_3))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork0_z_4) InVars {A=v_A_2, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_13} OutVars{A=v_A_2, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_4, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_13} AuxVars[] AssignedVars[sumThread1of1ForFork0_z] 147735#[L31-1, L54-1]don't care [2024-02-10 01:35:17,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:35:17,720 INFO L85 PathProgramCache]: Analyzing trace with hash 74974048, now seen corresponding path program 1 times [2024-02-10 01:35:17,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:35:17,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193255923] [2024-02-10 01:35:17,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:35:17,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:35:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:35:17,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:35:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:35:17,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:35:17,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:35:17,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2587876, now seen corresponding path program 1 times [2024-02-10 01:35:17,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:35:17,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596003119] [2024-02-10 01:35:17,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:35:17,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:35:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:35:17,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:35:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:35:17,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:35:17,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:35:17,848 INFO L85 PathProgramCache]: Analyzing trace with hash 941668547, now seen corresponding path program 1 times [2024-02-10 01:35:17,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:35:17,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477454290] [2024-02-10 01:35:17,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:35:17,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:35:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:35:17,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:35:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:35:17,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:35:18,106 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:35:18,107 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:35:18,107 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:35:18,107 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:35:18,107 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:35:18,107 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:35:18,109 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:35:18,109 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:35:18,109 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum5.bpl_BEv2_Iteration1_Lasso [2024-02-10 01:35:18,109 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:35:18,109 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:35:18,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:35:18,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:35:18,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:35:18,302 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:35:18,305 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:35:18,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:35:18,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:35:18,309 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:35:18,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-10 01:35:18,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:35:18,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:35:18,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:35:18,345 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-10 01:35:18,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:35:18,375 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-02-10 01:35:18,375 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-10 01:35:18,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:35:18,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-02-10 01:35:18,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:35:18,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:35:18,410 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:35:18,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:35:18,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:35:18,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:35:18,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:35:18,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:35:18,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:35:18,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:35:18,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-10 01:35:18,453 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:35:18,467 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-10 01:35:18,467 INFO L444 ModelExtractionUtils]: 8 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-02-10 01:35:18,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:35:18,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:35:18,486 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:35:18,491 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:35:18,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-10 01:35:18,521 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:35:18,521 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:35:18,522 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork0_hi, sumThread1of1ForFork0_i) = 1*sumThread1of1ForFork0_hi - 1*sumThread1of1ForFork0_i Supporting invariants [] [2024-02-10 01:35:18,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-10 01:35:18,530 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:35:18,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:35:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:35:18,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:35:18,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:35:18,753 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-10 01:35:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:35:18,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:35:18,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:35:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:35:18,924 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-02-10 01:35:18,926 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:35:19,152 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 881 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:35:19,154 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:35:19,154 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:35:19,167 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:35:19,168 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:35:19,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:35:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:35:19,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 339 transitions. [2024-02-10 01:35:19,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 339 transitions. Stem has 5 letters. Loop has 4 letters. [2024-02-10 01:35:19,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:35:19,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 339 transitions. Stem has 9 letters. Loop has 4 letters. [2024-02-10 01:35:19,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:35:19,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 339 transitions. Stem has 5 letters. Loop has 8 letters. [2024-02-10 01:35:19,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:35:19,177 INFO L428 stractBuchiCegarLoop]: Abstraction has has 88 places, 1502 transitions, 6758 flow [2024-02-10 01:35:19,177 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:35:19,177 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:35:19,177 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 88 places, 1502 transitions, 6758 flow [2024-02-10 01:35:43,592 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 236199 states, 236189 states have (on average 6.717209522882099) internal successors, (1586531), 236198 states have internal predecessors, (1586531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:35:44,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 236199 states, 236189 states have (on average 6.717209522882099) internal successors, (1586531), 236198 states have internal predecessors, (1586531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:35:51,729 INFO L131 ngComponentsAnalysis]: Automaton has 15480 accepting balls. 132000 [2024-02-10 01:35:51,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:35:51,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:35:51,750 INFO L748 eck$LassoCheckResult]: Stem: Black: 295403#[$Ultimate##0]don't care [47] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_ULTIMATE.start_k4_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= v_ULTIMATE.start_k4_1 v_N_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1, ULTIMATE.start_k4=v_ULTIMATE.start_k4_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1, ULTIMATE.start_k4=v_ULTIMATE.start_k4_1} AuxVars[] AssignedVars[] Black: 295406#[L54]don't care [97] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo] Black: 295411#[$Ultimate##0, L54-1]don't care [100] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= v_ULTIMATE.start_k2_3 v_sumThread1of1ForFork1_hi_6) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_16, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_8, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_hi, sumThread1of1ForFork1_z, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_thidvar1, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x, sumThread1of1ForFork1_lo] Black: 295419#[$Ultimate##0, L55, $Ultimate##0]don't care [77] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork1_x_1 0) InVars {} OutVars{sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_x] Black: 295435#[L28, $Ultimate##0, L55]don't care [78] L28-->L30: Formula: (= v_sumThread1of1ForFork1_z_1 0) InVars {} OutVars{sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_z] Black: 295467#[$Ultimate##0, L55, L30]don't care [79] L30-->L31-1: Formula: (= v_sumThread1of1ForFork1_i_1 v_sumThread1of1ForFork1_lo_1) InVars {sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_1} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_1, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_i] 295529#[L31-1, $Ultimate##0, L55]don't care [2024-02-10 01:35:51,751 INFO L750 eck$LassoCheckResult]: Loop: 295529#[L31-1, $Ultimate##0, L55]don't care [81] L31-1-->L32: Formula: (< v_sumThread1of1ForFork1_i_5 v_sumThread1of1ForFork1_hi_3) InVars {sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_5, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_3} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_5, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_3} AuxVars[] AssignedVars[] Black: 295682#[L32, $Ultimate##0, L55]don't care [83] L32-->L33: Formula: (= (+ (select v_A_1 v_sumThread1of1ForFork1_i_7) v_sumThread1of1ForFork1_x_3) v_sumThread1of1ForFork1_x_4) InVars {A=v_A_1, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_7, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_3} OutVars{A=v_A_1, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_7, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_x] 295998#[L33, $Ultimate##0, L55]don't care [84] L33-->L34: Formula: (= (+ v_sumThread1of1ForFork1_i_9 1) v_sumThread1of1ForFork1_i_10) InVars {sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_9} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_10} AuxVars[] AssignedVars[sumThread1of1ForFork1_i] Black: 296610#[$Ultimate##0, L55, L34]don't care [85] L34-->L31-1: Formula: (= v_sumThread1of1ForFork1_z_4 (let ((.cse0 (+ (select v_A_2 v_sumThread1of1ForFork1_i_13) v_sumThread1of1ForFork1_z_3))) (ite (< 0 .cse0) .cse0 0))) InVars {A=v_A_2, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_13, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_3} OutVars{A=v_A_2, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_13, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_z] 295529#[L31-1, $Ultimate##0, L55]don't care [2024-02-10 01:35:51,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:35:51,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1969256387, now seen corresponding path program 1 times [2024-02-10 01:35:51,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:35:51,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30591192] [2024-02-10 01:35:51,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:35:51,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:35:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:35:51,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:35:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:35:51,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:35:51,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:35:51,779 INFO L85 PathProgramCache]: Analyzing trace with hash 3419044, now seen corresponding path program 1 times [2024-02-10 01:35:51,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:35:51,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717877669] [2024-02-10 01:35:51,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:35:51,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:35:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:35:51,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:35:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:35:51,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:35:51,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:35:51,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1558366752, now seen corresponding path program 1 times [2024-02-10 01:35:51,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:35:51,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881087281] [2024-02-10 01:35:51,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:35:51,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:35:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:35:51,883 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:35:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:35:51,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:35:52,031 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:35:52,031 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:35:52,031 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:35:52,032 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:35:52,032 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:35:52,032 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:35:52,032 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:35:52,032 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:35:52,032 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum5.bpl_BEv2_Iteration2_Lasso [2024-02-10 01:35:52,032 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:35:52,032 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:35:52,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:35:52,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:35:52,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:35:52,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:35:52,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:35:52,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:35:52,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:35:52,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:35:52,241 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:35:52,242 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:35:52,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:35:52,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:35:52,243 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:35:52,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-10 01:35:52,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:35:52,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:35:52,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:35:52,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:35:52,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:35:52,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:35:52,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:35:52,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:35:52,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-10 01:35:52,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:35:52,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:35:52,296 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:35:52,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-10 01:35:52,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:35:52,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:35:52,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:35:52,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:35:52,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:35:52,337 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:35:52,337 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:35:52,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:35:52,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-02-10 01:35:52,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:35:52,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:35:52,376 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:35:52,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-10 01:35:52,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:35:52,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:35:52,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:35:52,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:35:52,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:35:52,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:35:52,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:35:52,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:35:52,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:35:52,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-02-10 01:35:52,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:35:52,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:35:52,414 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:35:52,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-02-10 01:35:52,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:35:52,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:35:52,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:35:52,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:35:52,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:35:52,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:35:52,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:35:52,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:35:52,432 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:35:52,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-02-10 01:35:52,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:35:52,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:35:52,437 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:35:52,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-10 01:35:52,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:35:52,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:35:52,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:35:52,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:35:52,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:35:52,457 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:35:52,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:35:52,482 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:35:52,500 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-02-10 01:35:52,500 INFO L444 ModelExtractionUtils]: 9 out of 31 variables were initially zero. Simplification set additionally 19 variables to zero. [2024-02-10 01:35:52,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:35:52,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:35:52,501 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:35:52,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-10 01:35:52,504 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:35:52,521 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:35:52,521 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:35:52,521 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork1_hi, sumThread1of1ForFork1_i) = 1*sumThread1of1ForFork1_hi - 1*sumThread1of1ForFork1_i Supporting invariants [] [2024-02-10 01:35:52,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-02-10 01:35:52,535 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:35:52,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:35:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:35:52,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:35:52,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:35:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:35:52,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:35:52,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:35:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:35:52,591 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-02-10 01:35:52,591 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:35:52,656 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 881 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:35:52,656 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:35:52,656 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:35:52,790 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:35:52,791 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:35:52,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:35:52,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:35:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 339 transitions. [2024-02-10 01:35:52,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 339 transitions. Stem has 6 letters. Loop has 4 letters. [2024-02-10 01:35:52,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:35:52,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 339 transitions. Stem has 10 letters. Loop has 4 letters. [2024-02-10 01:35:52,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:35:52,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 339 transitions. Stem has 6 letters. Loop has 8 letters. [2024-02-10 01:35:52,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:35:52,794 INFO L428 stractBuchiCegarLoop]: Abstraction has has 106 places, 38220 transitions, 248040 flow [2024-02-10 01:35:52,794 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:35:52,794 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:35:52,794 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 106 places, 38220 transitions, 248040 flow [2024-02-10 01:35:53,610 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 Received shutdown request... [2024-02-10 01:39:40,350 WARN L341 stractBuchiCegarLoop]: Verification cancelled [2024-02-10 01:39:40,355 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-02-10 01:39:40,370 INFO L201 PluginConnector]: Adding new model max-tailsum5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:39:40 BoogieIcfgContainer [2024-02-10 01:39:40,370 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:39:40,371 INFO L158 Benchmark]: Toolchain (without parser) took 274398.18ms. Allocated memory was 151.0MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 122.1MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 5.5GB. Max. memory is 8.0GB. [2024-02-10 01:39:40,371 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 151.0MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:39:40,371 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.37ms. Allocated memory is still 151.0MB. Free memory was 121.8MB in the beginning and 120.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 01:39:40,372 INFO L158 Benchmark]: Boogie Preprocessor took 90.66ms. Allocated memory was 151.0MB in the beginning and 256.9MB in the end (delta: 105.9MB). Free memory was 120.3MB in the beginning and 233.9MB in the end (delta: -113.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 01:39:40,372 INFO L158 Benchmark]: RCFGBuilder took 320.41ms. Allocated memory is still 256.9MB. Free memory was 233.9MB in the beginning and 223.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-02-10 01:39:40,373 INFO L158 Benchmark]: BuchiAutomizer took 273925.90ms. Allocated memory was 256.9MB in the beginning and 7.8GB in the end (delta: 7.5GB). Free memory was 222.8MB in the beginning and 3.6GB in the end (delta: -3.4GB). Peak memory consumption was 5.5GB. Max. memory is 8.0GB. [2024-02-10 01:39:40,374 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.10ms. Allocated memory is still 151.0MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.37ms. Allocated memory is still 151.0MB. Free memory was 121.8MB in the beginning and 120.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 90.66ms. Allocated memory was 151.0MB in the beginning and 256.9MB in the end (delta: 105.9MB). Free memory was 120.3MB in the beginning and 233.9MB in the end (delta: -113.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 320.41ms. Allocated memory is still 256.9MB. Free memory was 233.9MB in the beginning and 223.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 273925.90ms. Allocated memory was 256.9MB in the beginning and 7.8GB in the end (delta: 7.5GB). Free memory was 222.8MB in the beginning and 3.6GB in the end (delta: -3.4GB). Peak memory consumption was 5.5GB. 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 2 terminating modules (0 trivial, 2 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. The remainder module has 248040 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 273.8s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 397 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 395 mSDsluCounter, 652 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 318 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 334 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital86 mio100 ax100 hnf100 lsp119 ukn66 mio100 lsp54 div100 bol100 ite100 ukn100 eq165 hnf93 smp100 dnf193 smp56 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 98ms 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 BuchiPetriNet2FiniteAutomaton. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown