/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:27:31,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:27:31,758 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 00:27:31,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:27:31,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:27:31,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:27:31,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:27:31,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:27:31,811 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:27:31,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:27:31,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:27:31,816 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:27:31,816 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:27:31,817 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:27:31,817 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:27:31,817 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:27:31,818 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:27:31,818 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:27:31,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:27:31,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:27:31,819 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:27:31,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:27:31,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:27:31,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:27:31,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:27:31,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:27:31,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:27:31,821 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:27:31,821 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:27:31,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:27:31,823 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:27:31,823 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:27:31,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:27:31,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:27:31,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:27:31,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:27:31,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:27:31,824 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:27:31,825 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 00:27:32,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:27:32,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:27:32,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:27:32,421 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:27:32,423 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:27:32,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs.bpl [2024-02-10 00:27:32,424 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs.bpl' [2024-02-10 00:27:32,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:27:32,485 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:27:32,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:27:32,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:27:32,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:27:32,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:32" (1/1) ... [2024-02-10 00:27:32,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:32" (1/1) ... [2024-02-10 00:27:32,553 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 00:27:32,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:27:32,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:27:32,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:27:32,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:27:32,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:32" (1/1) ... [2024-02-10 00:27:32,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:32" (1/1) ... [2024-02-10 00:27:32,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:32" (1/1) ... [2024-02-10 00:27:32,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:32" (1/1) ... [2024-02-10 00:27:32,661 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:32" (1/1) ... [2024-02-10 00:27:32,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:32" (1/1) ... [2024-02-10 00:27:32,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:32" (1/1) ... [2024-02-10 00:27:32,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:32" (1/1) ... [2024-02-10 00:27:32,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:27:32,671 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:27:32,671 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:27:32,671 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:27:32,672 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:32" (1/1) ... [2024-02-10 00:27:32,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:32,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:32,712 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 00:27:32,744 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 00:27:32,786 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2024-02-10 00:27:32,786 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2024-02-10 00:27:32,792 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2024-02-10 00:27:32,792 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:27:32,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:27:32,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:27:32,793 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2024-02-10 00:27:32,793 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2024-02-10 00:27:32,793 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2024-02-10 00:27:32,793 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2024-02-10 00:27:32,793 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2024-02-10 00:27:32,793 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2024-02-10 00:27:32,793 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2024-02-10 00:27:32,794 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2024-02-10 00:27:32,794 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2024-02-10 00:27:32,795 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 00:27:32,866 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:27:32,868 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:27:33,002 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:27:33,009 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:27:33,009 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 00:27:33,011 INFO L201 PluginConnector]: Adding new model min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:27:33 BoogieIcfgContainer [2024-02-10 00:27:33,011 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:27:33,012 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:27:33,013 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:27:33,025 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:27:33,025 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:27:33,026 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:32" (1/2) ... [2024-02-10 00:27:33,027 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14cad7bb and model type min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:27:33, skipping insertion in model container [2024-02-10 00:27:33,027 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:27:33,027 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:27:33" (2/2) ... [2024-02-10 00:27:33,029 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-sample-abs.bpl [2024-02-10 00:27:33,164 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 00:27:33,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 104 flow [2024-02-10 00:27:33,298 INFO L124 PetriNetUnfolderBase]: 3/33 cut-off events. [2024-02-10 00:27:33,298 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:27:33,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 33 events. 3/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 85 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2024-02-10 00:27:33,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 41 transitions, 104 flow [2024-02-10 00:27:33,307 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 84 flow [2024-02-10 00:27:33,312 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:27:33,313 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:27:33,313 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:27:33,313 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:27:33,313 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:27:33,313 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:27:33,313 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:27:33,313 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:27:33,313 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:27:33,314 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 43 places, 33 transitions, 84 flow [2024-02-10 00:27:33,610 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 2102 states, 2100 states have (on average 3.7204761904761905) internal successors, (7813), 2101 states have internal predecessors, (7813), 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 00:27:33,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2102 states, 2100 states have (on average 3.7204761904761905) internal successors, (7813), 2101 states have internal predecessors, (7813), 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 00:27:33,952 INFO L131 ngComponentsAnalysis]: Automaton has 375 accepting balls. 1641 [2024-02-10 00:27:33,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:27:33,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:27:33,960 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:27:33,972 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:27:33,972 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 43 places, 33 transitions, 84 flow [2024-02-10 00:27:34,143 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 2102 states, 2100 states have (on average 3.7204761904761905) internal successors, (7813), 2101 states have internal predecessors, (7813), 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 00:27:34,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2102 states, 2100 states have (on average 3.7204761904761905) internal successors, (7813), 2101 states have internal predecessors, (7813), 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 00:27:34,246 INFO L131 ngComponentsAnalysis]: Automaton has 375 accepting balls. 1641 [2024-02-10 00:27:34,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:27:34,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:27:34,268 INFO L748 eck$LassoCheckResult]: Stem: Black: 4256#[$Ultimate##0]don't care [104] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 4259#[L77, $Ultimate##0]don't care [95] $Ultimate##0-->L30: Formula: (= (select v_A_5 0) v_array_min_4) InVars {A=v_A_5} OutVars{A=v_A_5, array_min=v_array_min_4} AuxVars[] AssignedVars[array_min] 4263#[L30, L77]don't care [96] L30-->L32-1: Formula: (= v_computeMinThread1of1ForFork0_i1_1 0) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_1} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1] 4271#[L32-1, L77]don't care [2024-02-10 00:27:34,270 INFO L750 eck$LassoCheckResult]: Loop: 4271#[L32-1, L77]don't care [98] L32-1-->L33: Formula: (< v_computeMinThread1of1ForFork0_i1_5 v_N_5) InVars {computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_5, N=v_N_5} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_5, N=v_N_5} AuxVars[] AssignedVars[] 4289#[L77, L33]don't care [100] L33-->L34: Formula: (= (let ((.cse0 (let ((.cse1 (select v_A_6 v_computeMinThread1of1ForFork0_i1_7))) (ite (< .cse1 0) (- .cse1) .cse1)))) (ite (< v_array_min_6 .cse0) v_array_min_6 .cse0)) v_array_min_5) InVars {A=v_A_6, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_7, array_min=v_array_min_6} OutVars{A=v_A_6, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_7, array_min=v_array_min_5} AuxVars[] AssignedVars[array_min] 4325#[L77, L34]don't care [101] L34-->L32-1: Formula: (= v_computeMinThread1of1ForFork0_i1_10 (+ v_computeMinThread1of1ForFork0_i1_9 1)) InVars {computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_9} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_10} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1] 4271#[L32-1, L77]don't care [2024-02-10 00:27:34,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:34,279 INFO L85 PathProgramCache]: Analyzing trace with hash 132776, now seen corresponding path program 1 times [2024-02-10 00:27:34,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:34,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594467347] [2024-02-10 00:27:34,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:34,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:34,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:34,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:34,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:34,455 INFO L85 PathProgramCache]: Analyzing trace with hash 127170, now seen corresponding path program 1 times [2024-02-10 00:27:34,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:34,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270889013] [2024-02-10 00:27:34,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:34,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:34,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:34,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:34,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:34,524 INFO L85 PathProgramCache]: Analyzing trace with hash -339340101, now seen corresponding path program 1 times [2024-02-10 00:27:34,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:34,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071178332] [2024-02-10 00:27:34,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:34,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:34,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:34,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:35,046 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:27:35,047 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:27:35,047 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:27:35,047 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:27:35,048 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:27:35,048 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:35,048 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:27:35,048 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:27:35,048 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:27:35,048 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:27:35,048 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:27:35,110 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 00:27:35,123 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 00:27:35,529 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:27:35,533 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:27:35,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:35,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:35,550 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 00:27:35,558 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 00:27:35,559 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 00:27:35,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:35,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:35,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:35,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:35,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:27:35,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:27:35,601 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:27:35,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-10 00:27:35,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:35,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:35,633 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 00:27:35,672 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 00:27:35,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:35,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:35,680 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2024-02-10 00:27:35,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:35,712 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 00:27:35,768 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2024-02-10 00:27:35,768 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2024-02-10 00:27:35,853 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:27:35,888 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-10 00:27:35,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:35,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:35,900 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 00:27:35,940 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 00:27:35,945 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 00:27:35,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:35,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:35,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:35,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:35,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:27:35,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:27:35,988 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:27:35,997 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 00:27:35,997 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 00:27:35,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:35,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:36,015 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 00:27:36,044 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:27:36,051 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 00:27:36,067 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:27:36,067 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:27:36,068 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(computeMinThread1of1ForFork0_i1, N) = -1*computeMinThread1of1ForFork0_i1 + 1*N Supporting invariants [] [2024-02-10 00:27:36,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-02-10 00:27:36,108 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:27:36,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:27:36,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:27:36,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:27:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:27:36,241 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:27:36,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:27:36,268 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 00:27:36,335 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-02-10 00:27:36,337 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 00:27:36,592 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 517 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:27:36,594 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:27:36,594 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:27:36,595 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:27:36,676 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:27:36,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-02-10 00:27:36,677 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:27:36,679 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 00:27:36,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 00:27:36,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2024-02-10 00:27:36,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 199 transitions. Stem has 3 letters. Loop has 3 letters. [2024-02-10 00:27:36,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:36,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 199 transitions. Stem has 6 letters. Loop has 3 letters. [2024-02-10 00:27:36,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:36,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 199 transitions. Stem has 3 letters. Loop has 6 letters. [2024-02-10 00:27:36,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:36,710 INFO L428 stractBuchiCegarLoop]: Abstraction has has 52 places, 413 transitions, 1871 flow [2024-02-10 00:27:36,710 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:27:36,710 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:27:36,710 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 52 places, 413 transitions, 1871 flow [2024-02-10 00:27:37,461 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 4454 states, 4448 states have (on average 5.582508992805756) internal successors, (24831), 4453 states have internal predecessors, (24831), 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 00:27:37,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4454 states, 4448 states have (on average 5.582508992805756) internal successors, (24831), 4453 states have internal predecessors, (24831), 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 00:27:37,667 INFO L131 ngComponentsAnalysis]: Automaton has 382 accepting balls. 1386 [2024-02-10 00:27:37,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:27:37,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:27:37,670 INFO L748 eck$LassoCheckResult]: Stem: Black: 8504#[$Ultimate##0]don't care [104] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] Black: 8507#[$Ultimate##0, L77]don't care [107] L77-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_14, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1] Black: 8512#[$Ultimate##0, L78, $Ultimate##0]don't care [78] $Ultimate##0-->L44: Formula: (= (select v_A_1 0) v_array_max_1) InVars {A=v_A_1} OutVars{A=v_A_1, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max] 8525#[L44, $Ultimate##0, L78]don't care [79] L44-->L46-1: Formula: (= v_computeMaxThread1of1ForFork1_i2_1 0) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_1} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2] 8543#[L46-1, L78, $Ultimate##0]don't care [2024-02-10 00:27:37,670 INFO L750 eck$LassoCheckResult]: Loop: 8543#[L46-1, L78, $Ultimate##0]don't care [81] L46-1-->L47: Formula: (< v_computeMaxThread1of1ForFork1_i2_5 v_N_1) InVars {computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_5, N=v_N_1} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_5, N=v_N_1} AuxVars[] AssignedVars[] 8601#[$Ultimate##0, L78, L47]don't care [83] L47-->L48: Formula: (= (let ((.cse0 (let ((.cse1 (select v_A_2 v_computeMaxThread1of1ForFork1_i2_7))) (ite (< .cse1 0) (- .cse1) .cse1)))) (ite (< v_array_max_3 .cse0) .cse0 v_array_max_3)) v_array_max_2) InVars {A=v_A_2, array_max=v_array_max_3, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_7} OutVars{A=v_A_2, array_max=v_array_max_2, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_7} AuxVars[] AssignedVars[array_max] 8715#[L78, $Ultimate##0, L48]don't care [84] L48-->L46-1: Formula: (= v_computeMaxThread1of1ForFork1_i2_10 (+ v_computeMaxThread1of1ForFork1_i2_9 1)) InVars {computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_9} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_10} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2] 8543#[L46-1, L78, $Ultimate##0]don't care [2024-02-10 00:27:37,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:37,670 INFO L85 PathProgramCache]: Analyzing trace with hash 4127109, now seen corresponding path program 1 times [2024-02-10 00:27:37,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:37,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639439675] [2024-02-10 00:27:37,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:37,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:37,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:37,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:37,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:37,689 INFO L85 PathProgramCache]: Analyzing trace with hash 110289, now seen corresponding path program 1 times [2024-02-10 00:27:37,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:37,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394215981] [2024-02-10 00:27:37,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:37,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:37,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:37,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:37,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:37,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1603266867, now seen corresponding path program 1 times [2024-02-10 00:27:37,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:37,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586689834] [2024-02-10 00:27:37,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:37,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:37,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:37,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:38,137 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:27:38,137 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:27:38,137 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:27:38,137 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:27:38,138 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:27:38,138 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:38,138 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:27:38,138 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:27:38,138 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:27:38,138 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:27:38,138 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:27:38,142 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 00:27:38,144 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 00:27:38,266 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 00:27:38,270 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 00:27:38,272 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 00:27:38,808 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:27:38,809 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:27:38,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:38,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:38,811 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 00:27:38,818 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 00:27:38,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:38,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:27:38,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:38,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:38,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:38,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:27:38,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:27:38,900 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 00:27:38,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:27:38,911 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 00:27:38,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:38,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:38,913 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 00:27:38,919 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 00:27:38,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:38,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:38,928 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2024-02-10 00:27:38,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:38,955 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 00:27:39,022 INFO L401 nArgumentSynthesizer]: We have 96 Motzkin's Theorem applications. [2024-02-10 00:27:39,022 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2024-02-10 00:27:39,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:27:39,195 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 00:27:39,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:39,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:39,204 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 00:27:39,240 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 00:27:39,250 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 00:27:39,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:39,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:39,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:39,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:39,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:27:39,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:27:39,348 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:27:39,353 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 00:27:39,353 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 00:27:39,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:39,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:39,354 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 00:27:39,361 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 00:27:39,362 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:27:39,428 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:27:39,428 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:27:39,428 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(computeMaxThread1of1ForFork1_i2, N) = -1*computeMaxThread1of1ForFork1_i2 + 1*N Supporting invariants [] [2024-02-10 00:27:39,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-10 00:27:39,438 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:27:39,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:27:39,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:27:39,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:27:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:27:39,501 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:27:39,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:27:39,540 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 00:27:39,541 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-02-10 00:27:39,543 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 00:27:39,673 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 517 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:27:39,674 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:27:39,674 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:27:39,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 517 transitions. [2024-02-10 00:27:39,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 517 transitions. [2024-02-10 00:27:39,697 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:27:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 517 transitions. [2024-02-10 00:27:39,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 517 transitions. [2024-02-10 00:27:39,762 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 00:27:40,123 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:27:40,124 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:27:40,124 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 00:27:40,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 00:27:40,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2024-02-10 00:27:40,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 199 transitions. Stem has 4 letters. Loop has 3 letters. [2024-02-10 00:27:40,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:40,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 199 transitions. Stem has 7 letters. Loop has 3 letters. [2024-02-10 00:27:40,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:40,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 199 transitions. Stem has 4 letters. Loop has 6 letters. [2024-02-10 00:27:40,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:40,127 INFO L428 stractBuchiCegarLoop]: Abstraction has has 65 places, 6722 transitions, 43782 flow [2024-02-10 00:27:40,127 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:27:40,127 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:27:40,127 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 65 places, 6722 transitions, 43782 flow [2024-02-10 00:27:47,912 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 11556 states, 11526 states have (on average 7.396494881138296) internal successors, (85252), 11555 states have internal predecessors, (85252), 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 00:27:47,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11556 states, 11526 states have (on average 7.396494881138296) internal successors, (85252), 11555 states have internal predecessors, (85252), 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 00:27:48,357 INFO L131 ngComponentsAnalysis]: Automaton has 300 accepting balls. 1800 [2024-02-10 00:27:48,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:27:48,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:27:48,358 INFO L748 eck$LassoCheckResult]: Stem: Black: 19816#[$Ultimate##0]don't care [104] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] Black: 19825#[L77, $Ultimate##0]don't care [107] L77-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_14, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1] Black: 19840#[$Ultimate##0, L78, $Ultimate##0]don't care [110] L78-->$Ultimate##0: Formula: (and (= v_sampleThread1of1ForFork2_thidvar0_2 3) (= v_sampleThread1of1ForFork2_thidvar2_2 3) (= v_sampleThread1of1ForFork2_thidvar1_2 3)) InVars {} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_4, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_6, sampleThread1of1ForFork2_thidvar0=v_sampleThread1of1ForFork2_thidvar0_2, sampleThread1of1ForFork2_thidvar2=v_sampleThread1of1ForFork2_thidvar2_2, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_6, sampleThread1of1ForFork2_thidvar1=v_sampleThread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff, sampleThread1of1ForFork2_min_l, sampleThread1of1ForFork2_thidvar0, sampleThread1of1ForFork2_thidvar2, sampleThread1of1ForFork2_max_l, sampleThread1of1ForFork2_thidvar1] 19899#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L79]don't care [113] L79-->$Ultimate##0: Formula: (and (= v_mapAbsThread1of1ForFork3_thidvar2_2 4) (= v_mapAbsThread1of1ForFork3_thidvar1_2 4) (= v_mapAbsThread1of1ForFork3_thidvar0_2 4) (= v_mapAbsThread1of1ForFork3_thidvar3_2 4)) InVars {} OutVars{mapAbsThread1of1ForFork3_thidvar3=v_mapAbsThread1of1ForFork3_thidvar3_2, mapAbsThread1of1ForFork3_thidvar2=v_mapAbsThread1of1ForFork3_thidvar2_2, mapAbsThread1of1ForFork3_thidvar1=v_mapAbsThread1of1ForFork3_thidvar1_2, mapAbsThread1of1ForFork3_thidvar0=v_mapAbsThread1of1ForFork3_thidvar0_2, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_14} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_thidvar3, mapAbsThread1of1ForFork3_thidvar2, mapAbsThread1of1ForFork3_thidvar1, mapAbsThread1of1ForFork3_thidvar0, mapAbsThread1of1ForFork3_j] Black: 19982#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, L80]don't care [89] $Ultimate##0-->L58-1: Formula: (= v_mapAbsThread1of1ForFork3_j_1 0) InVars {} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_1} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j] 20269#[L58-1, $Ultimate##0, $Ultimate##0, $Ultimate##0, L80]don't care [2024-02-10 00:27:48,359 INFO L750 eck$LassoCheckResult]: Loop: 20269#[L58-1, $Ultimate##0, $Ultimate##0, $Ultimate##0, L80]don't care [91] L58-1-->L59: Formula: (< v_mapAbsThread1of1ForFork3_j_5 v_N_4) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[] Black: 20774#[$Ultimate##0, L59, $Ultimate##0, $Ultimate##0, L80]don't care [93] L59-->L60: Formula: (= (store v_A_4 v_mapAbsThread1of1ForFork3_j_7 (let ((.cse0 (select v_A_4 v_mapAbsThread1of1ForFork3_j_7))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_3) InVars {A=v_A_4, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} OutVars{A=v_A_3, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} AuxVars[] AssignedVars[A] 21645#[L60, $Ultimate##0, $Ultimate##0, $Ultimate##0, L80]don't care [94] L60-->L58-1: Formula: (= v_mapAbsThread1of1ForFork3_j_10 (+ v_mapAbsThread1of1ForFork3_j_9 1)) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_9} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_10} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j] Black: 20266#[L58-1, $Ultimate##0, $Ultimate##0, $Ultimate##0, L80]don't care [91] L58-1-->L59: Formula: (< v_mapAbsThread1of1ForFork3_j_5 v_N_4) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_5, N=v_N_4} AuxVars[] AssignedVars[] 20779#[$Ultimate##0, L59, $Ultimate##0, $Ultimate##0, L80]don't care [93] L59-->L60: Formula: (= (store v_A_4 v_mapAbsThread1of1ForFork3_j_7 (let ((.cse0 (select v_A_4 v_mapAbsThread1of1ForFork3_j_7))) (ite (< .cse0 0) (- .cse0) .cse0))) v_A_3) InVars {A=v_A_4, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} OutVars{A=v_A_3, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_7} AuxVars[] AssignedVars[A] Black: 21642#[L60, $Ultimate##0, $Ultimate##0, $Ultimate##0, L80]don't care [94] L60-->L58-1: Formula: (= v_mapAbsThread1of1ForFork3_j_10 (+ v_mapAbsThread1of1ForFork3_j_9 1)) InVars {mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_9} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_10} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j] 20269#[L58-1, $Ultimate##0, $Ultimate##0, $Ultimate##0, L80]don't care [2024-02-10 00:27:48,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:48,359 INFO L85 PathProgramCache]: Analyzing trace with hash 127972274, now seen corresponding path program 1 times [2024-02-10 00:27:48,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:48,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207705711] [2024-02-10 00:27:48,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:48,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:48,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:48,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:48,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:48,379 INFO L85 PathProgramCache]: Analyzing trace with hash -713432639, now seen corresponding path program 1 times [2024-02-10 00:27:48,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:48,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70529583] [2024-02-10 00:27:48,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:48,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:48,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:48,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:48,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:48,400 INFO L85 PathProgramCache]: Analyzing trace with hash 867650738, now seen corresponding path program 1 times [2024-02-10 00:27:48,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:48,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901801842] [2024-02-10 00:27:48,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:48,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:48,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:48,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:48,641 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:27:48,642 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:27:48,642 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:27:48,642 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:27:48,642 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:27:48,642 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:48,642 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:27:48,642 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:27:48,642 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs.bpl_BEv2_Iteration3_Lasso [2024-02-10 00:27:48,642 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:27:48,642 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:27:48,650 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 00:27:48,655 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 00:27:48,664 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 00:27:48,666 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 00:27:48,668 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 00:27:48,670 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 00:27:48,804 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 00:27:48,807 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 00:27:48,811 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 00:27:48,813 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 00:27:48,816 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 00:27:48,818 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 00:27:48,820 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 00:27:48,823 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 00:27:48,826 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 00:27:48,829 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 00:27:48,975 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:27:48,976 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:27:48,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:48,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:48,977 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 00:27:48,984 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 00:27:48,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:48,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:48,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:48,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:48,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:27:48,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:27:48,998 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 00:27:49,005 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:27:49,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-02-10 00:27:49,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:49,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:49,056 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:27:49,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-10 00:27:49,099 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 00:27:49,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:49,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:49,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:49,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:49,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:27:49,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:27:49,130 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:27:49,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-02-10 00:27:49,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:49,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:49,161 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:27:49,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-10 00:27:49,202 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 00:27:49,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:49,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:27:49,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:49,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:49,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:49,213 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:27:49,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:27:49,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:27:49,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-02-10 00:27:49,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:49,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:49,256 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:27:49,263 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 00:27:49,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:49,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:27:49,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:49,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:49,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:49,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:27:49,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:27:49,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-10 00:27:49,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:27:49,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-02-10 00:27:49,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:49,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:49,309 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:27:49,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-02-10 00:27:49,353 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 00:27:49,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:49,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:49,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:49,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:49,403 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:27:49,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:27:49,424 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:27:49,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-02-10 00:27:49,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:49,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:49,439 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:27:49,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-02-10 00:27:49,445 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 00:27:49,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:49,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:49,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:49,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:49,469 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:27:49,469 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:27:49,492 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:27:49,548 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-10 00:27:49,549 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-02-10 00:27:49,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:49,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:49,557 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:27:49,588 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:27:49,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-02-10 00:27:49,665 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:27:49,666 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:27:49,666 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(mapAbsThread1of1ForFork3_j, N) = -1*mapAbsThread1of1ForFork3_j + 1*N Supporting invariants [] [2024-02-10 00:27:49,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-02-10 00:27:49,689 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 00:27:49,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:27:49,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:27:49,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:27:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:27:49,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 00:27:49,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:27:49,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:27:49,806 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 00:27:49,807 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 00:27:49,923 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 8 states and 478 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:27:49,924 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:27:49,924 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:27:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states and 478 transitions. [2024-02-10 00:27:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 478 transitions. [2024-02-10 00:27:49,926 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:27:49,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states and 478 transitions. [2024-02-10 00:27:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 478 transitions. [2024-02-10 00:27:50,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-02-10 00:27:56,691 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:27:56,691 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:27:56,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 00:27:56,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 00:27:56,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2024-02-10 00:27:56,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 5 letters. Loop has 6 letters. [2024-02-10 00:27:56,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:56,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 11 letters. Loop has 6 letters. [2024-02-10 00:27:56,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:56,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 5 letters. Loop has 12 letters. [2024-02-10 00:27:56,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:56,697 INFO L428 stractBuchiCegarLoop]: Abstraction has has 77 places, 103132 transitions, 875615 flow [2024-02-10 00:27:56,697 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 00:27:56,700 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:27:56,700 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 77 places, 103132 transitions, 875615 flow Received shutdown request... [2024-02-10 00:32:16,258 WARN L341 stractBuchiCegarLoop]: Verification cancelled [2024-02-10 00:32:16,263 INFO L201 PluginConnector]: Adding new model min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:32:16 BoogieIcfgContainer [2024-02-10 00:32:16,263 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:32:16,264 INFO L158 Benchmark]: Toolchain (without parser) took 283778.92ms. Allocated memory was 165.7MB in the beginning and 5.3GB in the end (delta: 5.2GB). Free memory was 105.2MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 3.9GB. Max. memory is 8.0GB. [2024-02-10 00:32:16,264 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 165.7MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:32:16,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 124.76ms. Allocated memory is still 165.7MB. Free memory was 105.2MB in the beginning and 139.8MB in the end (delta: -34.5MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2024-02-10 00:32:16,265 INFO L158 Benchmark]: Boogie Preprocessor took 57.65ms. Allocated memory is still 165.7MB. Free memory was 139.8MB in the beginning and 140.8MB in the end (delta: -1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:32:16,266 INFO L158 Benchmark]: RCFGBuilder took 340.80ms. Allocated memory is still 165.7MB. Free memory was 140.6MB in the beginning and 130.6MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-02-10 00:32:16,266 INFO L158 Benchmark]: BuchiAutomizer took 283250.64ms. Allocated memory was 165.7MB in the beginning and 5.3GB in the end (delta: 5.2GB). Free memory was 130.3MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2024-02-10 00:32:16,267 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.13ms. Allocated memory is still 165.7MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 124.76ms. Allocated memory is still 165.7MB. Free memory was 105.2MB in the beginning and 139.8MB in the end (delta: -34.5MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.65ms. Allocated memory is still 165.7MB. Free memory was 139.8MB in the beginning and 140.8MB in the end (delta: -1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 340.80ms. Allocated memory is still 165.7MB. Free memory was 140.6MB in the beginning and 130.6MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 283250.64ms. Allocated memory was 165.7MB in the beginning and 5.3GB in the end (delta: 5.2GB). Free memory was 130.3MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 4.0GB. 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 N + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function N + -1 * i2 and consists of 5 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. The remainder module has 875615 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 283.0s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 4.9s. Construction of modules took 0.1s. Büchi inclusion checks took 8.0s. 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: 3/3 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 344 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 341 mSDsluCounter, 501 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 234 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 245 IncrementalHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 267 mSDtfsCounter, 245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital132 mio100 ax100 hnf100 lsp636 ukn9 mio100 lsp75 div100 bol100 ite100 ukn100 eq161 hnf96 smp100 dnf328 smp53 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 262ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 96 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s - 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